On the optimum distance profiles about linear block codes

Authors:
Yuan Luo;A. J. Han Vinck;Yanling Chen
Affiliations:
Computer Science and Engineering Department, Shanghai Jiao Tong University, Shanghai, China and MOE-Microsoft Key Laboratory for Intelligent Computing and Intelligent Systems, Shanghai, China;Institute for Experimental Mathematics, Duisburg-Essen University, Essen, Germany;Institute for Experimental Mathematics, Duisburg-Essen University, Essen, Germany
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 6
Cited 0

Optimal ternary linear codes

Designs, Codes and Cryptography
Fundamentals of Convolutional Coding

Fundamentals of Convolutional Coding
The Determination of the Chain Good Weight Hierarchies with High Dimension

SIAM Journal on Discrete Mathematics
Error Control Coding, Second Edition

Error Control Coding, Second Edition
WCDMA for UMTS: HSPA Evolution and LTE

WCDMA for UMTS: HSPA Evolution and LTE
A characterization of certain Griesmer codes: MMD codes in a more general sense

IEEE Transactions on Information Theory

Quantified Score

Hi-index	754.84

Visualization

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.