Academic literature on the topic 'Error correcting index codes'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Error correcting index codes.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Error correcting index codes"

1

Pedrosa, Valéria G., and Max H. M. Costa. "Index Coding with Multiple Interpretations." Entropy 24, no. 8 (2022): 1149. http://dx.doi.org/10.3390/e24081149.

Full text
Abstract:
The index coding problem consists of a system with a server and multiple receivers with different side information and demand sets, connected by a noiseless broadcast channel. The server knows the side information available to the receivers. The objective is to design an encoding scheme that enables all receivers to decode their demanded messages with a minimum number of transmissions, referred to as an index code length. The problem of finding the minimum length index code that enables all receivers to correct a specific number of errors has also been studied. This work establishes a connecti
APA, Harvard, Vancouver, ISO, and other styles
2

Hawkins, John A., Stephen K. Jones, Ilya J. Finkelstein, and William H. Press. "Indel-correcting DNA barcodes for high-throughput sequencing." Proceedings of the National Academy of Sciences 115, no. 27 (2018): E6217—E6226. http://dx.doi.org/10.1073/pnas.1802640115.

Full text
Abstract:
Many large-scale, high-throughput experiments use DNA barcodes, short DNA sequences prepended to DNA libraries, for identification of individuals in pooled biomolecule populations. However, DNA synthesis and sequencing errors confound the correct interpretation of observed barcodes and can lead to significant data loss or spurious results. Widely used error-correcting codes borrowed from computer science (e.g., Hamming, Levenshtein codes) do not properly account for insertions and deletions (indels) in DNA barcodes, even though deletions are the most common type of synthesis error. Here, we pr
APA, Harvard, Vancouver, ISO, and other styles
3

Karat, Nujoom Sageer, Simon Samuel, and B. Sundar Rajan. "Optimal Error Correcting Index Codes for Some Generalized Index Coding Problems." IEEE Transactions on Communications 67, no. 2 (2019): 929–42. http://dx.doi.org/10.1109/tcomm.2018.2878566.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Thomas, Anoop, and B. Sundar Rajan. "A Discrete Polymatroidal Framework for Differential Error-Correcting Index Codes." IEEE Transactions on Communications 67, no. 7 (2019): 4593–604. http://dx.doi.org/10.1109/tcomm.2019.2910266.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Yao, Yu, Yuena Ma, Husheng Li, and Jingjie Lv. "An explicit construction of quantum codes from one-generator generalized quasi-cyclic codes." MATEC Web of Conferences 336 (2021): 04001. http://dx.doi.org/10.1051/matecconf/202133604001.

Full text
Abstract:
In this paper, we take advantage of a class of one-generator generalized quasi-cyclic (GQC) codes of index 2 to construct quantum error-correcting codes. By studying the form of Hermitian dual codes and their algebraic structure, we propose a sufficient condition for self-orthogonality of GQC codes with Hermitian inner product. By comparison, the quantum codes we constructed have better parameters than known codes.
APA, Harvard, Vancouver, ISO, and other styles
6

Kadiev, I. P., P. A. Kadiev, and B. R. Kudaev. "INTERLEAVING BURST ERROR ELEMENTS IN INFORMATION ARRAYS USING THE METHOD OF INDEX STRUCTURISATION." Herald of Dagestan State Technical University. Technical Sciences 46, no. 4 (2020): 84–90. http://dx.doi.org/10.21822/2073-6185-2019-46-4-84-90.

Full text
Abstract:
Objectives. “Burst errors” representing groups of accidentally or intentionally distorted or “erased” characters in blocks of information arrays violate the integrity of their content. However, the use of special codes for detecting and correcting such errors significantly reduces the speed of information transfer due to the need to introduce redundancy in the form of a large number of control characters. Therefore, this study sets out to develop a method for correcting burst errors.Method. A possible approach for correcting burst errors consists in interleaving preliminary permutations of inf
APA, Harvard, Vancouver, ISO, and other styles
7

Sageer Karat, Nujoom, Anoop Thomas, and Balaji Sundar Rajan. "Optimal Linear Error Correcting Delivery Schemes for Two Optimal Coded Caching Schemes." Entropy 22, no. 7 (2020): 766. http://dx.doi.org/10.3390/e22070766.

Full text
Abstract:
For coded caching problems with small buffer sizes and the number of users no less than the amount of files in the server, an optimal delivery scheme was proposed by Chen, Fan, and Letaief in 2016. This scheme is referred to as the CFL scheme. In this paper, an extension to the coded caching problem where the link between the server and the users is error prone, is considered. The closed form expressions for average rate and peak rate of error correcting delivery scheme are found for the CFL prefetching scheme using techniques from index coding. Using results from error correcting index coding
APA, Harvard, Vancouver, ISO, and other styles
8

LIU, TAILIN, FENGTONG WEN, and QIAOYAN WEN. "ON THE AUTOMORPHISM GROUPS OF A FAMILY OF BINARY QUANTUM ERROR-CORRECTING CODES." International Journal of Quantum Information 04, no. 06 (2006): 1013–22. http://dx.doi.org/10.1142/s0219749906002377.

Full text
Abstract:
Based on the classical binary simplex code [Formula: see text] and any fixed-point-free element f of [Formula: see text], Calderbank et al. constructed a binary quantum error-correcting code [Formula: see text]. They proved that [Formula: see text] has a normal subgroup H, which is a semidirect product group of the centralizer Z(f) of f in GLm(2) with [Formula: see text], and the index [Formula: see text] is the number of elements of Ff = {f, 1 - f, 1/f, 1 - 1/f, 1/(1 - f), f/(1 - f)} that are conjugate to f. In this paper, a theorem to describe the relationship between the quotient group [For
APA, Harvard, Vancouver, ISO, and other styles
9

Indoonundon, Deevya, Tulsi Pawan Fowdur, and Sunjiv Soyjaudah. "A Concealment Aware UEP scheme for H.264 using RS Codes." Indonesian Journal of Electrical Engineering and Computer Science 6, no. 3 (2017): 671. http://dx.doi.org/10.11591/ijeecs.v6.i3.pp671-681.

Full text
Abstract:
<p>H.264/AVC is currently the most widely adopted video coding standard due to its high compression capability and flexibility. However, compressed videos are highly vulnerable to channel errors which may result in severe quality degradation of a video. This paper presents a concealment aware Unequal Error Protection (UEP) scheme for H.264 video compression using Reed Solomon (RS) codes. The proposed UEP technique assigns a code rate to each Macroblock (MB) based on the type of concealment and a Concealment Dependent Index (CDI). Two interleaving techniques, namely Frame Level Interleavi
APA, Harvard, Vancouver, ISO, and other styles
10

Haeupler, Bernhard, and Amirbehshad Shahrasbi. "Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound." Journal of the ACM 68, no. 5 (2021): 1–39. http://dx.doi.org/10.1145/3468265.

Full text
Abstract:
We introduce synchronization strings , which provide a novel way to efficiently deal with synchronization errors , i.e., insertions and deletions. Synchronization errors are strictly more general and much harder to cope with than more commonly considered Hamming-type errors , i.e., symbol substitutions and erasures. For every ε > 0, synchronization strings allow us to index a sequence with an ε -O(1) -size alphabet, such that one can efficiently transform k synchronization errors into (1 + ε)k Hamming-type errors . This powerful new technique has many applications. In this article, we focus
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Error correcting index codes"

1

Kosek, Peter M. "Error Correcting Codes." The Ohio State University, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=osu1417508067.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Skoglund, Isabell. "Reed-Solomon Codes - Error Correcting Codes." Thesis, Linnéuniversitetet, Institutionen för matematik (MA), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-97343.

Full text
Abstract:
In the following pages an introduction of the error correcting codes known as Reed-Solomon codes will be presented together with different approaches for decoding. This is supplemented by a Mathematica program and a description of this program that gives an understanding in how the choice of decoding algorithms affect the time it takes to find errors in stored or transmitted information.
APA, Harvard, Vancouver, ISO, and other styles
3

Wang, Xuesong. "Cartesian authentication codes from error correcting codes /." View abstract or full-text, 2004. http://library.ust.hk/cgi/db/thesis.pl?COMP%202004%20WANGX.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hessler, Martin. "Optimization, Matroids and Error-Correcting Codes." Doctoral thesis, Linköpings universitet, Tillämpad matematik, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-51722.

Full text
Abstract:
The first subject we investigate in this thesis deals with optimization problems on graphs. The edges are given costs defined by the values of independent exponential random variables. We show how to calculate some or all moments of the distributions of the costs of some optimization problems on graphs. The second subject that we investigate is 1-error correcting perfect binary codes, perfect codes for short. In most work about perfect codes, two codes are considered equivalent if there is an isometric mapping between them. We call this isometric equivalence. Another type of equivalence is giv
APA, Harvard, Vancouver, ISO, and other styles
5

Fyn-Sydney, Betty Iboroma. "Phan geometries and error correcting codes." Thesis, University of Birmingham, 2013. http://etheses.bham.ac.uk//id/eprint/4433/.

Full text
Abstract:
In this thesis, we define codes based on the Phan geometry of type An. We show that the action of the group SUn+1(q) is not irreducible on the code. In the rank two case, we prove that the code is spanned by those apartments which only consist of chambers belonging to the Phan geometry and obtain submodules for the code.
APA, Harvard, Vancouver, ISO, and other styles
6

Guruswami, Venkatesan 1976. "List decoding of error-correcting codes." Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/8700.

Full text
Abstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001.<br>Includes bibliographical references (p. 303-315).<br>Error-correcting codes are combinatorial objects designed to cope with the problem of reliable transmission of information on a noisy channel. A fundamental algorithmic challenge in coding theory and practice is to efficiently decode the original transmitted message even when a few symbols of the received word are in error. The naive search algorithm runs in exponential time, and several classical polynomial time decoding al
APA, Harvard, Vancouver, ISO, and other styles
7

Guo, Alan Xinyu. "New error correcting codes from lifting." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/99776.

Full text
Abstract:
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (pages 117-121).<br>Error correcting codes have been widely used for protecting information from noise. The theory of error correcting codes studies the range of parameters achievable by such codes, as well as the efficiency with wh
APA, Harvard, Vancouver, ISO, and other styles
8

Vicente, Renato. "Statistical physics of error-correcting codes." Thesis, Aston University, 2000. http://publications.aston.ac.uk/10608/.

Full text
Abstract:
In this thesis we use statistical physics techniques to study the typical performance of four families of error-correcting codes based on very sparse linear transformations: Sourlas codes, Gallager codes, MacKay-Neal codes and Kanter-Saad codes. We map the decoding problem onto an Ising spin system with many-spins interactions. We then employ the replica method to calculate averages over the quenched disorder represented by the code constructions, the arbitrary messages and the random noise vectors. We find, as the noise level increases, a phase transition between successful decoding and failu
APA, Harvard, Vancouver, ISO, and other styles
9

Erxleben, Wayne Henry 1963. "Error-correcting two-dimensional modulation codes." Thesis, The University of Arizona, 1993. http://hdl.handle.net/10150/291577.

Full text
Abstract:
Modulation coding, to limit the number of consecutive zeroes in a data stream, is essential in digital magnetic recording/playback systems. Additionally, such systems require error correction coding to ensure that the decoded output matches the recorder input, even if noise is present. Typically these two coding steps have been performed independently, although various methods of combining them into one step have recently appeared. Another recent development is two-dimensional modulation codes, which meet runlength constraints using several parallel recording tracks, significantly increasing c
APA, Harvard, Vancouver, ISO, and other styles
10

Joseph, Binoy. "Clustering For Designing Error Correcting Codes." Thesis, Indian Institute of Science, 1994. https://etd.iisc.ac.in/handle/2005/3915.

Full text
Abstract:
In this thesis we address the problem of designing codes for specific applications. To do so we make use of the relationship between clusters and codes. Designing a block code over any finite dimensional space may be thought of as forming the corresponding number of clusters over the particular dimensional space. In literature we have a number of algorithms available for clustering. We have examined the performance of a number of such algorithms, such as Linde-Buzo-Gray, Simulated Annealing, Simulated Annealing with Linde-Buzo-Gray, Deterministic Annealing, etc, for design of codes. But all th
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Error correcting index codes"

1

Baylis, John. Error-correcting Codes. Springer US, 1998. http://dx.doi.org/10.1007/978-1-4899-3276-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Weldon, E. J. Jr, coaut, ed. Error-Correcting Codes. 2nd ed. Massachusetts Institute of Technology, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Xambó-Descamps, Sebastià. Block Error-Correcting Codes. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-642-18997-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Vera, Pless, ed. Fundamentals of error-correcting codes. Cambridge University Press, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Buttigieg, Victor. Variable-length error-correcting codes.. University of Manchester, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Purser, Michael. Introduction to error-correcting codes. Artech House, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Calmet, Jacques, ed. Algebraic Algorithms and Error-Correcting Codes. Springer Berlin Heidelberg, 1986. http://dx.doi.org/10.1007/3-540-16776-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Guruswami, Venkatesan. List Decoding of Error-Correcting Codes. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/b104335.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Cancellieri, Giovanni. Polynomial Theory of Error Correcting Codes. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-01727-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

MacWilliams, Florence Jessie. The theory of error correcting codes. 8th ed. North-Holland Pub. Co., 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Error correcting index codes"

1

Basu, Riddhipratim, Subhamoy Maitra, Goutam Paul, and Tanmoy Talukdar. "On Some Sequences of the Secret Pseudo-random Index j in RC4 Key Scheduling." In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02181-7_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lally, Kristine. "Quasicyclic Codes of Index ℓ over F q Viewed as F q[x]-Submodules of F q ℓ[x]/〈x m−1〉." In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-44828-4_26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Slinko, Arkadii. "Error-Correcting Codes." In Springer Undergraduate Mathematics Series. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44074-9_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Jones, Gareth A., and J. Mary Jones. "Error-correcting Codes." In Springer Undergraduate Mathematics Series. Springer London, 2000. http://dx.doi.org/10.1007/978-1-4471-0361-5_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Finston, David R., and Patrick J. Morandi. "Error Correcting Codes." In Abstract Algebra. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-04498-9_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kumar, P. Vijay. "Error-Correcting Codes." In Space Communication and Nuclear Scintillation. Springer Netherlands, 1991. http://dx.doi.org/10.1007/978-94-017-5418-7_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Salomon, David. "Error Correcting Codes." In Data Compression. Springer New York, 1998. http://dx.doi.org/10.1007/978-1-4757-2939-9_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Liu, Andrew Chiang-Fung. "Error-Correcting Codes." In S.M.A.R.T. Circle Projects. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-56811-9_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

van Lint, Jacobus H., and Gerard van der Geer. "Error-correcting codes." In Introduction to Coding Theory and Algebraic Geometry. Birkhäuser Basel, 1988. http://dx.doi.org/10.1007/978-3-0348-9286-5_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Slinko, Arkadii. "Error-Correcting Codes." In Springer Undergraduate Mathematics Series. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-21951-6_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Error correcting index codes"

1

Thomas, Anoop, and B. Sundar Rajan. "Error correcting index codes and matroids." In 2015 IEEE International Symposium on Information Theory (ISIT). IEEE, 2015. http://dx.doi.org/10.1109/isit.2015.7282611.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Chinmayananda, A., and B. Sundar Rajan. "Optimal Error Correcting Index Codes for Extended Index Coding Problems." In 2019 19th International Symposium on Communications and Information Technologies (ISCIT). IEEE, 2019. http://dx.doi.org/10.1109/iscit.2019.8905117.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Karat, Nujoom Sageer, and B. Sundar Rajan. "Optimal Linear Error Correcting Index Codes for Some Index Coding Problems." In 2017 IEEE Wireless Communications and Networking Conference (WCNC). IEEE, 2017. http://dx.doi.org/10.1109/wcnc.2017.7925744.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Thomas, Anoop, and B. Sundar Rajan. "Vector linear error correcting index codes and discrete polymatroids." In 2015 IEEE International Symposium on Information Theory (ISIT). IEEE, 2015. http://dx.doi.org/10.1109/isit.2015.7282613.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Vaddi, Mahesh Babu, and B. Sundar Rajan. "Optimal error correcting index codes for two classes of index coding problems." In 2018 52nd Annual Conference on Information Sciences and Systems (CISS). IEEE, 2018. http://dx.doi.org/10.1109/ciss.2018.8362252.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Samuel, Simon, Nujoom Sageer Karat, and B. Sundar Rajan. "Optimal linear error-correcting index codes for some generalized index coding problems." In 2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC). IEEE, 2017. http://dx.doi.org/10.1109/pimrc.2017.8292448.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Gupta, Anindya, and B. Sundar Rajan. "Error-correcting functional index codes, generalized exclusive laws and graph coloring." In ICC 2016 - 2016 IEEE International Conference on Communications. IEEE, 2016. http://dx.doi.org/10.1109/icc.2016.7511555.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Samuel, Simon, and B. Sundar Rajan. "Optimal Linear Error-Correcting Index Codes for Single-Prior Index-Coding with Side Information." In 2017 IEEE Wireless Communications and Networking Conference (WCNC). IEEE, 2017. http://dx.doi.org/10.1109/wcnc.2017.7925745.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

HAGIWARA, MANABU. "QUANTUM ERROR-CORRECTING CODES." In Summer School on Mathematical Aspects of Quantum Computing. WORLD SCIENTIFIC, 2008. http://dx.doi.org/10.1142/9789812814487_0006.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Roth, Ron M. "Analog Error-Correcting Codes." In 2019 IEEE International Symposium on Information Theory (ISIT). IEEE, 2019. http://dx.doi.org/10.1109/isit.2019.8849843.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Error correcting index codes"

1

Auslander, Louis. Weil Transform and Error Correcting Codes. Defense Technical Information Center, 1996. http://dx.doi.org/10.21236/ada376721.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zhang, Xinmiao. Sensor Network Optimization by Using Error-Correcting Codes. Defense Technical Information Center, 2011. http://dx.doi.org/10.21236/ada565196.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Mitchell, Gregory. Investigation of Hamming, Reed-Solomon, and Turbo Forward Error Correcting Codes. Defense Technical Information Center, 2009. http://dx.doi.org/10.21236/ada505116.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

McEliece, Robert, and Padhraic Smyth. Turbo Decoding of High Performance Error-Correcting Codes via Belief Propagation. Defense Technical Information Center, 1998. http://dx.doi.org/10.21236/ada386835.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lala, P. K., and H. L. Martin. Application of Error Correcting Codes in Fault-Tolerant Logic Design for VLSI Circuits. Defense Technical Information Center, 1990. http://dx.doi.org/10.21236/ada228840.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!