Update efficient codes for error correction

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2012, Pages 1558-1562

  Mazumdar, Arya ^a   Wornell, Gregory W ^a   Chandar, Venkat ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b MIT LINCOLN LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BASIC PROPERTIES; BINARY ERASURE CHANNEL; BINARY SYMMETRIC CHANNEL; CODE-WORDS; CODEWORD; ERROR CORRECTING CODE; LINEAR CODES; SMALL PERTURBATIONS;

COMMUNICATION CHANNELS (INFORMATION THEORY); ERROR CORRECTION;

EFFICIENCY;

EID: 84867544012     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2012.6283534     Document Type: Conference Paper

References (14)

1. N. Alon, J. Spencer, The Probabilistic Method,Wiley-Interscience, 2000.
2. N. P. Anthapadmanabhan, E. Soljanin, S. Vishwanath, "Update- efficient codes for erasure correction," 48th Annual Allerton Conference on Communication, Control, and Computing, pp. 376-382, October, 2010.
3. A. Barg, G. D. Forney, Jr., "Random codes: minimum distances and error exponents," IEEE Transactions on Information Theory, vol. 48, no. 9, pp. 2568-2573, September, 2002.
4. B. I. Belov, V. N. Logachev, V. P. Sandimirov, "Construction of a class of linear binary codes achieving the Varshamov/Griesmer bound," Probl. Peredachi Inf., vol. 10, issue 3, pp. 36-44, 1974.
5. N. Calkin, "Dependent sets of constant weight binary vectors," Combinatorics, Probability and Computing, vol. 6, no. 3, pp. 263-271, 1997.
6. S. D. Dodunekov, N. L. Manev, "An improvement of the Griesmer bound for some small minimum distances," Discrete Applied Mathematics, vol. 12, pp. 103-114, 1985.
7. T. Helleseth, "New constructions of codes meeting the Griesmer bound," IEEE Transactions on Information Theory, vol. 29, no. 3, May, 1983.
8. W. C. Huffman, V. Pless, Fundamentals of Error-Correcting Codes, Cambridge, 2003.
9. A. Jule, I. Andriyanova, "Some Results on update complexity of a linear code ensemble," International Sym. on Network Coding, pp. 1-5, 2011.
10. A. M. Kakhaki, H. K. Abadi, P. Pad, H. Saeedi, F. Marvasti, K. Alishahi, "Capacity achieving linear codes with binary sparse generating matrices," preprint, arXiv:1102.4099, 2011.
11. M. Langberg, "Private codes or Succinct random codes that are (almost) perfect," Proc. Foundations of Computer Science, pp. 325-334, 2004.
12. F. Macwilliams, N. Sloane, The Theory of Error-Correcting Codes, North-Holland, 1977.
13. A. S. Rawat, S. Vishwanath, A. Bhowmick, E. Soljanin, "Update efficient codes for distributed storage," IEEE International Symposium on Information Theory, pp. 1457-1461, Jul 31-Aug 5, 2011.
14. J. Simonis,"On generator matrices of codes," IEEE Transactions on Information Theory, vol. 38, no. 2, March, 1992.