On the optimum distance profiles about linear block codes

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.

• Type: Journal
• Year: 2010
• Where: TIT
• Authors: Yuan Luo, A. J. Han Vinck, Yanling Chen
• Keywords: Dictionary Order, Distance Profile, Education, Inverse Dictionary Order, TIT 2010