Cited By
View all- Fredrikzon JHaffenden C(2023)Towards erasure studies: Excavating the material conditions of memory and forgettingMemory, Mind & Media10.1017/mem.2023.22Online publication date: 24-May-2023
Technical perspective
The beauty of error-correcting codes
Abstract
No abstract available.
References
[1]
Guruswami, V. and Sudan, M. Improved decoding of Reed-Solomon and algebraic-geometric codes. IEEE Trans. on Info. Theory, 45 (1999), 1757--1767.
[2]
Koetter, R. and Vardy, A. Algebraic soft-decision decoding of Reed-Solomon codes. IEEE Trans. on Info. Theory 49, 112 (2003), 2809--2825.
[3]
Parvaresh, F. and Vardy, A. Correcting errors beyond the Guruswami-Sudan radius in polynomial time. In Proceedings of the 46th IEEE Symposium on Foundations of Computer Science (2005), 285--294.
[4]
Sudan, M. Decoding the Reed-Solomon codes beyond the error-correction bound. Journal of Complexity 13, 1 (1997), 180--193.
Index Terms
- Technical perspective
The beauty of error-correcting codes
Recommendations
Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams
Coding in the projective space has received recently a lot of attention due to its application in network coding. Reduced row echelon form of the linear subspaces and Ferrers diagram can playa key role for solving coding problems in the projective ...
On Symmetric Error Correcting and all Unidirectional Error Detecting Codes
The design of binary block codes that are capable of correcting up to t symmetric errors and detecting all unidirectional errors is discussed. A class of systematic t-symmetric-error-correcting/all-unidirectional-error-detecting (t-SyEC/AUED) codes are ...
Optimal Unidirectional Error Detecting/Correcting Codes
In this correspondence a class of t-error correcting and multiple unidirectional error detecting systematic codes is presented. These codes are significantly more efficient than the earlier codes. The efficiency of these codes approaches the efficiency ...
Comments
Information & Contributors
Information
Published In
Copyright © 2009 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 March 2009
Published in CACM Volume 52, Issue 3
Check for updates
Qualifiers
- Research-article
- Popular
- Refereed
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 5,240Total Downloads
- Downloads (Last 12 months)63
- Downloads (Last 6 weeks)12
Reflects downloads up to 01 Mar 2025
Other Metrics
Citations
Cited By
View all- Fredrikzon JHaffenden C(2023)Towards erasure studies: Excavating the material conditions of memory and forgettingMemory, Mind & Media10.1017/mem.2023.22Online publication date: 24-May-2023
View Options
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderDigital Edition
View this article in digital edition.
Digital EditionMagazine Site
View this article on the magazine site (external)
Magazine SiteLogin options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in