On the optimum distance profiles about linear block codes

IEEE Transactions on Information Theory

Volumn 56, Issue 3, 2010, Pages 1007-1014

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

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b MICROSOFT   (United States)

^c UNIVERSITY OF DUISBURG ESSEN   (Germany)

Author keywords

Generalized ReedSolomon code; Golay code; Optimum distance profile (ODP) of linear block code; Transport format combination indicator

Indexed keywords

DISTANCE PROFILES; GENERALIZED REED-SOLOMON CODES; GOLAY CODE; LINEAR BLOCK CODE; TRANSPORT FORMAT COMBINATION INDICATORS;

MOBILE TELECOMMUNICATION SYSTEMS;

BLOCK CODES;

EID: 77949518713     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2009.2039059     Document Type: Article

References (14)

1. M. van Dijk, S. Baggen, and L. Tolhuizen, "Coding for informed decoders," in Proc. IEEE Int. Symp. Inf. Theory, Washington, DC, Jun. 2001, p. 202.
2. S. M. Dodunekov and S. B. Encheva, "Uniqueness of some linear subcodes of the extended binary Golay code," Probl. Inf. Transm., vol.29, no.1, pp. 38-43, 1993.
3. M. Grassl, Linear Block Codes, [Online]. Available: http://www. codetables.de/
4. A. J. Han Vinck and Y. Luo, "Optimum distance profiles of linear block codes," in Proc. IEEE Int. Symp. Inf. Theory, Jul. 2008, pp. 1958-1962.
5. R. Hill and D. E. Newton, "Optimal ternary linear codes," Des. Codes Cryptogr., vol.2, no.2, pp. 137-157, 1992.
6. H. Holma and A. Toskala, WCDMA for UMTS-HSPA Evolution and LTE, 4th ed. London, U.K.: Wiley, 2007.
7. R. Johannesson and K. Sh. Zigangirov, Fundamentals of Convolutional Coding. New York: IEEE Press, 1999.
8. S. Lin and D. J. Costello, Jr., Error Control Coding, 2nd ed. Upper Saddle River, NJ: Pearson, 2004.
9. Y. Luo, W. Chen, and A. J. Han Vinck, "The determination of the chain good weight hierarchies with high dimension," SIAM J. Discrete Math., vol.17, no.2, pp. 196-209, 2004.
10. F. J. Macwilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, 6th Printing. Amsterdam, The Netherlands: Elsevier Science, 1988.
11. J. Olsson and W. Willems, "A characterization of certain Griesmer codes: MMD codes in a more general sense," IEEE Trans. Inf. Theory, vol.45, no.6, pp. 2138-2142, Sep. 1999.
12. R. Tanner and J.Woodard,WCDMA-Requirements and Practical Design. London, U.K.: Wiley, 2004.
13. H. van Tilborg, "On the uniqueness resp. nonexistence of certain codes meeting the Griesmer bound," Inf. Control, vol.44, pp. 16-35, 1980.
14. V. K. Wei and K. Yang, "On the generalized Hamming weight of product codes," IEEE Trans. Inf. Theory, vol.39, no.5, pp. 1709-1713, Sep. 1993.