Error correction code (English Wikipedia)

Perry, Jonathan; Balakrishnan, Hari; Shah, Devavrat (2011). "Rateless Spinal Codes". Proceedings of the 10th ACM Workshop on Hot Topics in Networks. pp. 1–6. doi:10.1145/2070562.2070568. hdl:1721.1/79676. ISBN 9781450310598.

aero.org (Global: low place; English: low place)

Charles Wang; Dean Sklar; Diana Johnson (Winter 2001–2002). "Forward Error-Correction Coding". Crosslink. 3 (1). The Aerospace Corporation. Archived from the original on 14 March 2012. Retrieved 5 March 2006.
Charles Wang; Dean Sklar; Diana Johnson (Winter 2001–2002). "Forward Error-Correction Coding". Crosslink. 3 (1). The Aerospace Corporation. Archived from the original on 14 March 2012. Retrieved 5 March 2006. How Forward Error-Correcting Codes Work]

arxiv.org (Global: 69^th place; English: 59^th place)

Kothari, Pravesh K.; Manohar, Peter (2023). "An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes". arXiv:2311.00558 [cs.CC].
Kerenidis, Iordanis; de Wolf, Ronald (9 June 2003). "Exponential lower bound for 2-query locally decodable codes via a quantum argument". Proceedings of the thirty-fifth annual ACM symposium on Theory of computing. ACM. pp. 106–115. arXiv:quant-ph/0208062. doi:10.1145/780542.780560. ISBN 978-1-58113-674-6. S2CID 10585919.
Takeshita, Oscar (2006). "Permutation Polynomial Interleavers: An Algebraic-Geometric Perspective". IEEE Transactions on Information Theory. 53 (6): 2116–2132. arXiv:cs/0601048. Bibcode:2006cs........1048T. doi:10.1109/TIT.2007.896870. S2CID 660.
Krastanov, Stefan; Jiang, Liang (8 September 2017). "Deep Neural Network Probabilistic Decoder for Stabilizer Codes". Scientific Reports. 7 (1): 11003. arXiv:1705.09334. Bibcode:2017NatSR...711003K. doi:10.1038/s41598-017-11266-1. PMC 5591216. PMID 28887480.

cushychicken.github.io (Global: low place; English: low place)

Jim Cooke (August 2007). "The Inconvenient Truths of NAND Flash Memory" (PDF). p. 28. For SLC, a code with a correction threshold of 1 is sufficient. t=4 required ... for MLC.

doi.org (Global: 2^nd place; English: 2^nd place)

Hamming, Richard Wesley (April 1950). "Error Detecting and Error Correcting Codes". Bell System Technical Journal. 29 (2). USA: AT&T: 147–160. Bibcode:1950BSTJ...29..147H. doi:10.1002/j.1538-7305.1950.tb00463.x. hdl:10945/46756. S2CID 61141773.
Baldi, M.; Chiaraluce, F. (2008). "A Simple Scheme for Belief Propagation Decoding of BCH and RS Codes in Multimedia Transmissions". International Journal of Digital Multimedia Broadcasting. 2008: 1–12. doi:10.1155/2008/957846.
Shannon, C. E. (1948). "A mathematical theory of communication" (PDF). Bell System Technical Journal. 27 (3–4): 379–423 & 623–656. Bibcode:1948BSTJ...27..379S. doi:10.1002/j.1538-7305.1948.tb01338.x. hdl:11858/00-001M-0000-002C-4314-2.
Rosas, F.; Brante, G.; Souza, R. D.; Oberli, C. (2014). "Optimizing the code rate for achieving energy-efficient wireless communications". Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC). pp. 775–780. doi:10.1109/WCNC.2014.6952166. ISBN 978-1-4799-3083-8.
Kerenidis, Iordanis; de Wolf, Ronald (9 June 2003). "Exponential lower bound for 2-query locally decodable codes via a quantum argument". Proceedings of the thirty-fifth annual ACM symposium on Theory of computing. ACM. pp. 106–115. arXiv:quant-ph/0208062. doi:10.1145/780542.780560. ISBN 978-1-58113-674-6. S2CID 10585919.
Yekhanin, Sergey (February 2008). "Towards 3-query locally decodable codes of subexponential length". Journal of the ACM. 55 (1): 1–16. doi:10.1145/1326554.1326555. ISSN 0004-5411. S2CID 14617710.
Efremenko, Klim (31 May 2009). "3-query locally decodable codes of subexponential length". Proceedings of the forty-first annual ACM symposium on Theory of computing. ACM. pp. 39–44. doi:10.1145/1536414.1536422. ISBN 978-1-60558-506-2. S2CID 263865692. {{cite book}}: |journal= ignored (help)
Andrews, K. S.; Divsalar, D.; Dolinar, S.; Hamkins, J.; Jones, C. R.; Pollara, F. (November 2007). "The Development of Turbo and LDPC Codes for Deep-Space Applications". Proceedings of the IEEE. 95 (11): 2142–2156. doi:10.1109/JPROC.2007.905132. S2CID 9289140.
Takeshita, Oscar (2006). "Permutation Polynomial Interleavers: An Algebraic-Geometric Perspective". IEEE Transactions on Information Theory. 53 (6): 2116–2132. arXiv:cs/0601048. Bibcode:2006cs........1048T. doi:10.1109/TIT.2007.896870. S2CID 660.
Krastanov, Stefan; Jiang, Liang (8 September 2017). "Deep Neural Network Probabilistic Decoder for Stabilizer Codes". Scientific Reports. 7 (1): 11003. arXiv:1705.09334. Bibcode:2017NatSR...711003K. doi:10.1038/s41598-017-11266-1. PMC 5591216. PMID 28887480.
Nordstrom, A.W.; Robinson, J.P. (1967), "An optimum nonlinear code", Information and Control, 11 (5–6): 613–616, doi:10.1016/S0019-9958(67)90835-2
Perry, Jonathan; Balakrishnan, Hari; Shah, Devavrat (2011). "Rateless Spinal Codes". Proceedings of the 10th ACM Workshop on Hot Topics in Networks. pp. 1–6. doi:10.1145/2070562.2070568. hdl:1721.1/79676. ISBN 9781450310598.

eetasia.com (Global: low place; English: low place)

"Hamming codes for NAND flash memory devices" Archived 21 August 2016 at the Wayback Machine. EE Times-Asia. Apparently based on "Micron Technical Note TN-29-08: Hamming Codes for NAND Flash Memory Devices" Archived 29 August 2017 at the Wayback Machine. 2005. Both say: "The Hamming algorithm is an industry-accepted method for error detection and correction in many SLC NAND flash-based applications."

handle.net (Global: 102^nd place; English: 76^th place)

hdl.handle.net

Hamming, Richard Wesley (April 1950). "Error Detecting and Error Correcting Codes". Bell System Technical Journal. 29 (2). USA: AT&T: 147–160. Bibcode:1950BSTJ...29..147H. doi:10.1002/j.1538-7305.1950.tb00463.x. hdl:10945/46756. S2CID 61141773.
Shannon, C. E. (1948). "A mathematical theory of communication" (PDF). Bell System Technical Journal. 27 (3–4): 379–423 & 623–656. Bibcode:1948BSTJ...27..379S. doi:10.1002/j.1538-7305.1948.tb01338.x. hdl:11858/00-001M-0000-002C-4314-2.
Perry, Jonathan; Balakrishnan, Hari; Shah, Devavrat (2011). "Rateless Spinal Codes". Proceedings of the 10th ACM Workshop on Hot Topics in Networks. pp. 1–6. doi:10.1145/2070562.2070568. hdl:1721.1/79676. ISBN 9781450310598.

harvard.edu (Global: 18^th place; English: 17^th place)

ui.adsabs.harvard.edu

Hamming, Richard Wesley (April 1950). "Error Detecting and Error Correcting Codes". Bell System Technical Journal. 29 (2). USA: AT&T: 147–160. Bibcode:1950BSTJ...29..147H. doi:10.1002/j.1538-7305.1950.tb00463.x. hdl:10945/46756. S2CID 61141773.
Shannon, C. E. (1948). "A mathematical theory of communication" (PDF). Bell System Technical Journal. 27 (3–4): 379–423 & 623–656. Bibcode:1948BSTJ...27..379S. doi:10.1002/j.1538-7305.1948.tb01338.x. hdl:11858/00-001M-0000-002C-4314-2.
Dolinar, S.; Divsalar, D. (15 August 1995). "Weight Distributions for Turbo Codes Using Random and Nonrandom Permutations". TDA Progress Report. 122: 42–122. Bibcode:1995TDAPR.122...56D. CiteSeerX 10.1.1.105.6640.
Takeshita, Oscar (2006). "Permutation Polynomial Interleavers: An Algebraic-Geometric Perspective". IEEE Transactions on Information Theory. 53 (6): 2116–2132. arXiv:cs/0601048. Bibcode:2006cs........1048T. doi:10.1109/TIT.2007.896870. S2CID 660.
Krastanov, Stefan; Jiang, Liang (8 September 2017). "Deep Neural Network Probabilistic Decoder for Stabilizer Codes". Scientific Reports. 7 (1): 11003. arXiv:1705.09334. Bibcode:2017NatSR...711003K. doi:10.1038/s41598-017-11266-1. PMC 5591216. PMID 28887480.

math.harvard.edu

Shannon, C. E. (1948). "A mathematical theory of communication" (PDF). Bell System Technical Journal. 27 (3–4): 379–423 & 623–656. Bibcode:1948BSTJ...27..379S. doi:10.1002/j.1538-7305.1948.tb01338.x. hdl:11858/00-001M-0000-002C-4314-2.

hpi-web.de (Global: low place; English: low place)

eccc.hpi-web.de

Kaufman, Tali; Viderman, Michael. "Locally Testable vs. Locally Decodable Codes".

ieee.org (Global: 652^nd place; English: 515^th place)

standards.ieee.org

IEEE Standard, section 20.3.11.6 "802.11n-2009" Archived 3 February 2013 at the Wayback Machine, IEEE, 29 October 2009, accessed 21 March 2011.

micron.com (Global: low place; English: low place)

"Hamming codes for NAND flash memory devices" Archived 21 August 2016 at the Wayback Machine. EE Times-Asia. Apparently based on "Micron Technical Note TN-29-08: Hamming Codes for NAND Flash Memory Devices" Archived 29 August 2017 at the Wayback Machine. 2005. Both say: "The Hamming algorithm is an industry-accepted method for error detection and correction in many SLC NAND flash-based applications."

nih.gov (Global: 4^th place; English: 4^th place)

ncbi.nlm.nih.gov

Krastanov, Stefan; Jiang, Liang (8 September 2017). "Deep Neural Network Probabilistic Decoder for Stabilizer Codes". Scientific Reports. 7 (1): 11003. arXiv:1705.09334. Bibcode:2017NatSR...711003K. doi:10.1038/s41598-017-11266-1. PMC 5591216. PMID 28887480.

pubmed.ncbi.nlm.nih.gov

Krastanov, Stefan; Jiang, Liang (8 September 2017). "Deep Neural Network Probabilistic Decoder for Stabilizer Codes". Scientific Reports. 7 (1): 11003. arXiv:1705.09334. Bibcode:2017NatSR...711003K. doi:10.1038/s41598-017-11266-1. PMC 5591216. PMID 28887480.

psu.edu (Global: 207^th place; English: 136^th place)

citeseerx.ist.psu.edu

Dolinar, S.; Divsalar, D. (15 August 1995). "Weight Distributions for Turbo Codes Using Random and Nonrandom Permutations". TDA Progress Report. 122: 42–122. Bibcode:1995TDAPR.122...56D. CiteSeerX 10.1.1.105.6640.

quantamagazine.org (Global: 6,413^th place; English: 4,268^th place)

Brubaker, Ben (9 January 2024). "'Magical' Error Correction Scheme Proved Inherently Inefficient". Quanta Magazine. Retrieved 9 January 2024.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Hamming, Richard Wesley (April 1950). "Error Detecting and Error Correcting Codes". Bell System Technical Journal. 29 (2). USA: AT&T: 147–160. Bibcode:1950BSTJ...29..147H. doi:10.1002/j.1538-7305.1950.tb00463.x. hdl:10945/46756. S2CID 61141773.
Kerenidis, Iordanis; de Wolf, Ronald (9 June 2003). "Exponential lower bound for 2-query locally decodable codes via a quantum argument". Proceedings of the thirty-fifth annual ACM symposium on Theory of computing. ACM. pp. 106–115. arXiv:quant-ph/0208062. doi:10.1145/780542.780560. ISBN 978-1-58113-674-6. S2CID 10585919.
Yekhanin, Sergey (February 2008). "Towards 3-query locally decodable codes of subexponential length". Journal of the ACM. 55 (1): 1–16. doi:10.1145/1326554.1326555. ISSN 0004-5411. S2CID 14617710.
Efremenko, Klim (31 May 2009). "3-query locally decodable codes of subexponential length". Proceedings of the forty-first annual ACM symposium on Theory of computing. ACM. pp. 39–44. doi:10.1145/1536414.1536422. ISBN 978-1-60558-506-2. S2CID 263865692. {{cite book}}: |journal= ignored (help)
Andrews, K. S.; Divsalar, D.; Dolinar, S.; Hamkins, J.; Jones, C. R.; Pollara, F. (November 2007). "The Development of Turbo and LDPC Codes for Deep-Space Applications". Proceedings of the IEEE. 95 (11): 2142–2156. doi:10.1109/JPROC.2007.905132. S2CID 9289140.
Takeshita, Oscar (2006). "Permutation Polynomial Interleavers: An Algebraic-Geometric Perspective". IEEE Transactions on Information Theory. 53 (6): 2116–2132. arXiv:cs/0601048. Bibcode:2006cs........1048T. doi:10.1109/TIT.2007.896870. S2CID 660.

spansion.com (Global: low place; English: low place)

"What Types of ECC Should Be Used on Flash Memory?" (Application note). Spansion. 2011. Both Reed–Solomon algorithm and BCH algorithm are common ECC choices for MLC NAND flash. ... Hamming based block codes are the most commonly used ECC for SLC.... both Reed–Solomon and BCH are able to handle multiple errors and are widely used on MLC flash.

thinkmind.org (Global: low place; English: low place)

https://www.thinkmind.org/articles/icons_2015_5_20_40055.pdf ^{[bare URL PDF]}

usenix.org (Global: 5,990^th place; English: 3,752^nd place)

Shah, Gaurav; Molina, Andres; Blaze, Matt (2006). "Keyboards and covert channels". USENIX. Retrieved 20 December 2018.

w3techie.com (Global: low place; English: low place)

Techie (3 June 2010). "Explaining Interleaving". W3 Techie Blog. Retrieved 3 June 2010.

web.archive.org (Global: 1^st place; English: 1^st place)

Charles Wang; Dean Sklar; Diana Johnson (Winter 2001–2002). "Forward Error-Correction Coding". Crosslink. 3 (1). The Aerospace Corporation. Archived from the original on 14 March 2012. Retrieved 5 March 2006.
Charles Wang; Dean Sklar; Diana Johnson (Winter 2001–2002). "Forward Error-Correction Coding". Crosslink. 3 (1). The Aerospace Corporation. Archived from the original on 14 March 2012. Retrieved 5 March 2006. How Forward Error-Correcting Codes Work]
"Hamming codes for NAND flash memory devices" Archived 21 August 2016 at the Wayback Machine. EE Times-Asia. Apparently based on "Micron Technical Note TN-29-08: Hamming Codes for NAND Flash Memory Devices" Archived 29 August 2017 at the Wayback Machine. 2005. Both say: "The Hamming algorithm is an industry-accepted method for error detection and correction in many SLC NAND flash-based applications."
IEEE Standard, section 20.3.11.6 "802.11n-2009" Archived 3 February 2013 at the Wayback Machine, IEEE, 29 October 2009, accessed 21 March 2011.

worldcat.org (Global: 5^th place; English: 5^th place)

search.worldcat.org

Yekhanin, Sergey (February 2008). "Towards 3-query locally decodable codes of subexponential length". Journal of the ACM. 55 (1): 1–16. doi:10.1145/1326554.1326555. ISSN 0004-5411. S2CID 14617710.

Error correction code (English Wikipedia)

3gpp.org (Global: 7,203rd place; English: 4,927th place)

accelercomm.com (Global: low place; English: low place)

acm.org (Global: 1,185th place; English: 840th place)

dl.acm.org

doi.acm.org

aero.org (Global: low place; English: low place)

arxiv.org (Global: 69th place; English: 59th place)

cushychicken.github.io (Global: low place; English: low place)

doi.org (Global: 2nd place; English: 2nd place)

eetasia.com (Global: low place; English: low place)

handle.net (Global: 102nd place; English: 76th place)

hdl.handle.net

harvard.edu (Global: 18th place; English: 17th place)

ui.adsabs.harvard.edu

math.harvard.edu

hpi-web.de (Global: low place; English: low place)

eccc.hpi-web.de

ieee.org (Global: 652nd place; English: 515th place)

standards.ieee.org

micron.com (Global: low place; English: low place)

nih.gov (Global: 4th place; English: 4th place)

ncbi.nlm.nih.gov

pubmed.ncbi.nlm.nih.gov

psu.edu (Global: 207th place; English: 136th place)

citeseerx.ist.psu.edu

quantamagazine.org (Global: 6,413th place; English: 4,268th place)

semanticscholar.org (Global: 11th place; English: 8th place)

api.semanticscholar.org

spansion.com (Global: low place; English: low place)

thinkmind.org (Global: low place; English: low place)

usenix.org (Global: 5,990th place; English: 3,752nd place)

w3techie.com (Global: low place; English: low place)

web.archive.org (Global: 1st place; English: 1st place)

worldcat.org (Global: 5th place; English: 5th place)

search.worldcat.org

3gpp.org (Global: 7,203^rd place; English: 4,927^th place)

acm.org (Global: 1,185^th place; English: 840^th place)

arxiv.org (Global: 69^th place; English: 59^th place)

doi.org (Global: 2^nd place; English: 2^nd place)

handle.net (Global: 102^nd place; English: 76^th place)

harvard.edu (Global: 18^th place; English: 17^th place)

ieee.org (Global: 652^nd place; English: 515^th place)

nih.gov (Global: 4^th place; English: 4^th place)

psu.edu (Global: 207^th place; English: 136^th place)

quantamagazine.org (Global: 6,413^th place; English: 4,268^th place)

semanticscholar.org (Global: 11^th place; English: 8^th place)

usenix.org (Global: 5,990^th place; English: 3,752^nd place)

web.archive.org (Global: 1^st place; English: 1^st place)

worldcat.org (Global: 5^th place; English: 5^th place)