Optimum distance profiles of linear block codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2008, Pages 1958-1962

  Vinck, A J Han ^a,b   Luo, Yuan ^c  

^a IEEE

^b UNIVERSITY OF DUISBURG ESSEN   (Germany)

^c SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CDMA SYSTEMS; CODE-WORDS; DISTANCE PROFILES; INTERNATIONAL SYMPOSIUM; LINEAR BLOCK CODING; MINIMUM DISTANCES; SUBCODES; TRANSPORT FORMAT;

CODES (STANDARDS); CODES (SYMBOLS); CYBERNETICS; INFORMATION THEORY; TECHNICAL PRESENTATIONS;

BLOCK CODES;

EID: 52349107436     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2008.4595331     Document Type: Conference Paper

References (10)

1. M. Grassl, Linear Block Codes, http://www.codetables.de/.
2. R. Hill and D.E. Newton, "Optimal ternary linear codes," Designs, Codes and Cryptography, vol. 2 pp. 137-157, 1992.
3. H. Holma and A. Toskala, WCDMA for UMTS - HSPA Evolution and LTE, 4th Edition, John Wiley & Sons, 2007.
4. D. B. Jaffe, "Optimal binary linear codes of length ≤ 30," Discrete Mathematics, vol. 223 pp. 135-155, 2000.
5. D. B. Jaffe, Coding Theory Database, http://www.math.unl.edu/~djaffe2/.
6. F. J. Macwilliams and N. J. A. Sloane, The Theory of Error Corresting Codes, 5th printing, Elsevier Science Publishers, The Netherlands, 1986.
7. J. Olsson and W. Willems, "A characterization of certain Griesmer codes: MMD codes in a more general sense," IEEE Trans. Inform. Theory, vol. 45, no. 6, pp. 2138-2142, 1999.
8. R. Tanner and J. Woodard, WCDMA - Requirements and Practical Design, John Wiley & Sons, 2004.
9. H. van Tilborg, "On the uniqueness resp. nonexsitence of certain codes meeting the Griesmer bound," Information and Control, vol. 44, pp. 16-35, 1980.
10. H. N. Ward, "Divisibility of codes meeting the Griesmer bound," Journal of Combinatorial Theory, Series A, vol. 83 pp. 79-93, 1998.