Literatura académica sobre el tema "Error correcting index codes"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Error correcting index codes".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Error correcting index codes"
Pedrosa, Valéria G. y Max H. M. Costa. "Index Coding with Multiple Interpretations". Entropy 24, n.º 8 (18 de agosto de 2022): 1149. http://dx.doi.org/10.3390/e24081149.
Texto completoHawkins, John A., Stephen K. Jones, Ilya J. Finkelstein y William H. Press. "Indel-correcting DNA barcodes for high-throughput sequencing". Proceedings of the National Academy of Sciences 115, n.º 27 (20 de junio de 2018): E6217—E6226. http://dx.doi.org/10.1073/pnas.1802640115.
Texto completoKarat, Nujoom Sageer, Simon Samuel y B. Sundar Rajan. "Optimal Error Correcting Index Codes for Some Generalized Index Coding Problems". IEEE Transactions on Communications 67, n.º 2 (febrero de 2019): 929–42. http://dx.doi.org/10.1109/tcomm.2018.2878566.
Texto completoThomas, Anoop y B. Sundar Rajan. "A Discrete Polymatroidal Framework for Differential Error-Correcting Index Codes". IEEE Transactions on Communications 67, n.º 7 (julio de 2019): 4593–604. http://dx.doi.org/10.1109/tcomm.2019.2910266.
Texto completoYao, Yu, Yuena Ma, Husheng Li y 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.
Texto completoKadiev, I. P., P. A. Kadiev y 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, n.º 4 (2 de enero de 2020): 84–90. http://dx.doi.org/10.21822/2073-6185-2019-46-4-84-90.
Texto completoSageer Karat, Nujoom, Anoop Thomas y Balaji Sundar Rajan. "Optimal Linear Error Correcting Delivery Schemes for Two Optimal Coded Caching Schemes". Entropy 22, n.º 7 (13 de julio de 2020): 766. http://dx.doi.org/10.3390/e22070766.
Texto completoLIU, TAILIN, FENGTONG WEN y QIAOYAN WEN. "ON THE AUTOMORPHISM GROUPS OF A FAMILY OF BINARY QUANTUM ERROR-CORRECTING CODES". International Journal of Quantum Information 04, n.º 06 (diciembre de 2006): 1013–22. http://dx.doi.org/10.1142/s0219749906002377.
Texto completoIndoonundon, Deevya, Tulsi Pawan Fowdur y Sunjiv Soyjaudah. "A Concealment Aware UEP scheme for H.264 using RS Codes". Indonesian Journal of Electrical Engineering and Computer Science 6, n.º 3 (1 de junio de 2017): 671. http://dx.doi.org/10.11591/ijeecs.v6.i3.pp671-681.
Texto completoHaeupler, Bernhard y Amirbehshad Shahrasbi. "Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound". Journal of the ACM 68, n.º 5 (31 de octubre de 2021): 1–39. http://dx.doi.org/10.1145/3468265.
Texto completoTesis sobre el tema "Error correcting index codes"
Kosek, Peter M. "Error Correcting Codes". The Ohio State University, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=osu1417508067.
Texto completoSkoglund, 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.
Texto completoWang, 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.
Texto completoHessler, 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.
Texto completoFyn-Sydney, Betty Iboroma. "Phan geometries and error correcting codes". Thesis, University of Birmingham, 2013. http://etheses.bham.ac.uk//id/eprint/4433/.
Texto completoGuruswami, Venkatesan 1976. "List decoding of error-correcting codes". Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/8700.
Texto completoIncludes bibliographical references (p. 303-315).
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 algorithms are known for specific code families. Traditionally, however, these algorithms have been constrained to output a unique codeword. Thus they faced a "combinatorial barrier" and could only correct up to d/2 errors, where d is the minimum distance of the code. An alternate notion of decoding called list decoding, proposed independently by Elias and Wozencraft in the late 50s, allows the decoder to output a list of all codewords that differ from the received word in a certain number of positions. Even when constrained to output a relatively small number of answers, list decoding permits recovery from errors well beyond the d/2 barrier, and opens up the possibility of meaningful error-correction from large amounts of noise. However, for nearly four decades after its conception, this potential of list decoding was largely untapped due to the lack of efficient algorithms to list decode beyond d/2 errors for useful families of codes. This thesis presents a detailed investigation of list decoding, and proves its potential, feasibility, and importance as a combinatorial and algorithmic concept.
(cont.) We prove several combinatorial results that sharpen our understanding of the potential and limits of list decoding, and its relation to more classical parameters like the rate and minimum distance. The crux of the thesis is its algorithmic results, which were lacking in the early works on list decoding. Our algorithmic results include: * Efficient list decoding algorithms for classically studied codes such as Reed-Solomon codes and algebraic-geometric codes. In particular, building upon an earlier algorithm due to Sudan, we present the first polynomial time algorithm to decode Reed-Solomon codes beyond d/2 errors for every value of the rate. * A new soft list decoding algorithm for Reed-Solomon and algebraic-geometric codes, and novel decoding algorithms for concatenated codes based on it. * New code constructions using concatenation and/or expander graphs that have good (and sometimes near-optimal) rate and are efficiently list decodable from extremely large amounts of noise. * Expander-based constructions of linear time encodable and decodable codes that can correct up to the maximum possible fraction of errors, using unique (not list) decoding.
by Venkatesan Guruswami.
Ph.D.
Guo, Alan Xinyu. "New error correcting codes from lifting". Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/99776.
Texto completoThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 117-121).
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 which one can encode and decode them. In recent years, attention has focused on the study of sublinear-time algorithms for various classical problems, such as decoding and membership verification. This attention was driven in part by theoretical developments in probabilistically checkable proofs (PCPs) and hardness of approximation. Locally testable codes (codes for which membership can be verified using a sublinear number of queries) form the combinatorial core of PCP constructions and thus play a central role in computational complexity theory. Historically, low-degree polynomials (the Reed-Muller code) have been the locally testable code of choice. Recently, "affine-invariant" codes have come under focus as providing potential for new and improved codes. In this thesis, we exploit a natural algebraic operation known as "lifting" to construct new affine-invariant codes from shorter base codes. These lifted codes generically possess desirable combinatorial and algorithmic properties. The lifting operation preserves the distance of the base code. Moreover, lifted codes are naturally locally decodable and testable. We tap deeper into the potential of lifted codes by constructing the "lifted Reed-Solomon code", a supercode of the Reed-Muller code with the same error-correcting capabilities yet vastly greater rate. The lifted Reed-Solomon code is the first high-rate code known to be locally decodable up to half the minimum distance, locally list-decodable up to the Johnson bound, and robustly testable, with robustness that depends only on the distance of the code. In particular, it is the first high-rate code known to be both locally decodable and locally testable. We also apply the lifted Reed-Solomon code to obtain new bounds on the size of Nikodym sets, and also to show that the Reed-Muller code is robustly testable for all field sizes and degrees up to the field size, with robustness that depends only on the distance of the code.
by Alan Xinyu Guo.
Ph. D.
Vicente, Renato. "Statistical physics of error-correcting codes". Thesis, Aston University, 2000. http://publications.aston.ac.uk/10608/.
Texto completoErxleben, Wayne Henry 1963. "Error-correcting two-dimensional modulation codes". Thesis, The University of Arizona, 1993. http://hdl.handle.net/10150/291577.
Texto completoJoseph, Binoy. "Clustering For Designing Error Correcting Codes". Thesis, Indian Institute of Science, 1994. https://etd.iisc.ac.in/handle/2005/3915.
Texto completoLibros sobre el tema "Error correcting index codes"
Baylis, John. Error-correcting Codes. Boston, MA: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4899-3276-1.
Texto completoWeldon, E. J. Jr, coaut, ed. Error-Correcting Codes. 2a ed. Boston: Massachusetts Institute of Technology, 1988.
Buscar texto completoXambó-Descamps, Sebastià. Block Error-Correcting Codes. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-642-18997-5.
Texto completoVera, Pless, ed. Fundamentals of error-correcting codes. Cambridge: Cambridge University Press, 2010.
Buscar texto completoButtigieg, Victor. Variable-length error-correcting codes.. Manchester: University of Manchester, 1995.
Buscar texto completoPurser, Michael. Introduction to error-correcting codes. Boston: Artech House, 1995.
Buscar texto completoCalmet, Jacques, ed. Algebraic Algorithms and Error-Correcting Codes. Berlin, Heidelberg: Springer Berlin Heidelberg, 1986. http://dx.doi.org/10.1007/3-540-16776-5.
Texto completoGuruswami, Venkatesan. List Decoding of Error-Correcting Codes. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/b104335.
Texto completoCancellieri, Giovanni. Polynomial Theory of Error Correcting Codes. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-01727-3.
Texto completoMacWilliams, Florence Jessie. The theory of error correcting codes. 8a ed. Amsterdam: North-Holland Pub. Co., 1993.
Buscar texto completoCapítulos de libros sobre el tema "Error correcting index codes"
Basu, Riddhipratim, Subhamoy Maitra, Goutam Paul y Tanmoy Talukdar. "On Some Sequences of the Secret Pseudo-random Index j in RC4 Key Scheduling". En Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 137–48. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02181-7_15.
Texto completoLally, Kristine. "Quasicyclic Codes of Index ℓ over F q Viewed as F q[x]-Submodules of F q ℓ[x]/〈x m−1〉". En Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 244–53. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-44828-4_26.
Texto completoSlinko, Arkadii. "Error-Correcting Codes". En Springer Undergraduate Mathematics Series, 191–234. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44074-9_7.
Texto completoJones, Gareth A. y J. Mary Jones. "Error-correcting Codes". En Springer Undergraduate Mathematics Series, 97–119. London: Springer London, 2000. http://dx.doi.org/10.1007/978-1-4471-0361-5_6.
Texto completoFinston, David R. y Patrick J. Morandi. "Error Correcting Codes". En Abstract Algebra, 23–40. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-04498-9_2.
Texto completoKumar, P. Vijay. "Error-Correcting Codes". En Space Communication and Nuclear Scintillation, 224–313. Dordrecht: Springer Netherlands, 1991. http://dx.doi.org/10.1007/978-94-017-5418-7_2.
Texto completoSalomon, David. "Error Correcting Codes". En Data Compression, 337–48. New York, NY: Springer New York, 1998. http://dx.doi.org/10.1007/978-1-4757-2939-9_10.
Texto completoLiu, Andrew Chiang-Fung. "Error-Correcting Codes". En S.M.A.R.T. Circle Projects, 1–16. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-56811-9_1.
Texto completovan Lint, Jacobus H. y Gerard van der Geer. "Error-correcting codes". En Introduction to Coding Theory and Algebraic Geometry, 13–14. Basel: Birkhäuser Basel, 1988. http://dx.doi.org/10.1007/978-3-0348-9286-5_2.
Texto completoSlinko, Arkadii. "Error-Correcting Codes". En Springer Undergraduate Mathematics Series, 171–211. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-21951-6_7.
Texto completoActas de conferencias sobre el tema "Error correcting index codes"
Thomas, Anoop y B. Sundar Rajan. "Error correcting index codes and matroids". En 2015 IEEE International Symposium on Information Theory (ISIT). IEEE, 2015. http://dx.doi.org/10.1109/isit.2015.7282611.
Texto completoChinmayananda, A. y B. Sundar Rajan. "Optimal Error Correcting Index Codes for Extended Index Coding Problems". En 2019 19th International Symposium on Communications and Information Technologies (ISCIT). IEEE, 2019. http://dx.doi.org/10.1109/iscit.2019.8905117.
Texto completoKarat, Nujoom Sageer y B. Sundar Rajan. "Optimal Linear Error Correcting Index Codes for Some Index Coding Problems". En 2017 IEEE Wireless Communications and Networking Conference (WCNC). IEEE, 2017. http://dx.doi.org/10.1109/wcnc.2017.7925744.
Texto completoThomas, Anoop y B. Sundar Rajan. "Vector linear error correcting index codes and discrete polymatroids". En 2015 IEEE International Symposium on Information Theory (ISIT). IEEE, 2015. http://dx.doi.org/10.1109/isit.2015.7282613.
Texto completoVaddi, Mahesh Babu y B. Sundar Rajan. "Optimal error correcting index codes for two classes of index coding problems". En 2018 52nd Annual Conference on Information Sciences and Systems (CISS). IEEE, 2018. http://dx.doi.org/10.1109/ciss.2018.8362252.
Texto completoSamuel, Simon, Nujoom Sageer Karat y B. Sundar Rajan. "Optimal linear error-correcting index codes for some generalized index coding problems". En 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.
Texto completoGupta, Anindya y B. Sundar Rajan. "Error-correcting functional index codes, generalized exclusive laws and graph coloring". En ICC 2016 - 2016 IEEE International Conference on Communications. IEEE, 2016. http://dx.doi.org/10.1109/icc.2016.7511555.
Texto completoSamuel, Simon y B. Sundar Rajan. "Optimal Linear Error-Correcting Index Codes for Single-Prior Index-Coding with Side Information". En 2017 IEEE Wireless Communications and Networking Conference (WCNC). IEEE, 2017. http://dx.doi.org/10.1109/wcnc.2017.7925745.
Texto completoHAGIWARA, MANABU. "QUANTUM ERROR-CORRECTING CODES". En Summer School on Mathematical Aspects of Quantum Computing. WORLD SCIENTIFIC, 2008. http://dx.doi.org/10.1142/9789812814487_0006.
Texto completoRoth, Ron M. "Analog Error-Correcting Codes". En 2019 IEEE International Symposium on Information Theory (ISIT). IEEE, 2019. http://dx.doi.org/10.1109/isit.2019.8849843.
Texto completoInformes sobre el tema "Error correcting index codes"
Auslander, Louis. Weil Transform and Error Correcting Codes. Fort Belvoir, VA: Defense Technical Information Center, julio de 1996. http://dx.doi.org/10.21236/ada376721.
Texto completoZhang, Xinmiao. Sensor Network Optimization by Using Error-Correcting Codes. Fort Belvoir, VA: Defense Technical Information Center, febrero de 2011. http://dx.doi.org/10.21236/ada565196.
Texto completoMitchell, Gregory. Investigation of Hamming, Reed-Solomon, and Turbo Forward Error Correcting Codes. Fort Belvoir, VA: Defense Technical Information Center, julio de 2009. http://dx.doi.org/10.21236/ada505116.
Texto completoMcEliece, Robert y Padhraic Smyth. Turbo Decoding of High Performance Error-Correcting Codes via Belief Propagation. Fort Belvoir, VA: Defense Technical Information Center, diciembre de 1998. http://dx.doi.org/10.21236/ada386835.
Texto completoLala, P. K. y H. L. Martin. Application of Error Correcting Codes in Fault-Tolerant Logic Design for VLSI Circuits. Fort Belvoir, VA: Defense Technical Information Center, mayo de 1990. http://dx.doi.org/10.21236/ada228840.
Texto completo