On the Optimum Distance Profiles About Linear Block Codes

Author

Luo, Yuan ; Vinck, A. J Han ; Chen, Yanling

Author_Institution

Comput. Sci. & Eng. Dept., Shanghai Jiao Tong Univ., Shanghai, China

Volume

56

Issue

3

fYear

2010

fDate

3/1/2010 12:00:00 AM

Firstpage

1007

Lastpage

1014

Abstract

In this paper, for some linear block codes, two kinds of optimum distance profiles (ODPs) are introduced to consider how to construct and then exclude (or include) the basis codewords one by one while keeping a distance profile as large as possible in a dictionary order (or in an inverse dictionary order, respectively). The aim is to improve fault-tolerant capability by selecting subcodes in communications and storage systems. One application is to serve a suitable code for the realization of the transport format combination indicators (TFCIs) of code-division multiple-access (CDMA) systems. Another application is in the field of address retrieval on optical media.

Keywords

block codes; code division multiple access; fault tolerance; linear codes; CDMA; address retrieval; basis codewords; code-division multiple-access; fault tolerant capability; inverse dictionary order; linear block codes; optical media; optimum distance profiles; transport format combination indicators; Block codes; Computer science; Convolutional codes; Dictionaries; Fault tolerant systems; Helium; Information theory; Intelligent systems; Laboratories; Multiaccess communication; Generalized Reed–Solomon code; Golay code; optimum distance profile (ODP) of linear block code; transport format combination indicator;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/TIT.2009.2039059

Filename

5429102