On the Optimum Distance Profiles About Linear Block Codes

On the Optimum Distance Profiles About Linear Block Codes
复制标题

线性分组码的最佳距离分布

DOI:
10.1109/isit.2008.4595331
复制
发表时间:
2008-07
影响因子:
2.5
通讯作者:
Yanling Chen
Yanling Chen
中科院分区:
计算机科学2区
文献类型:
--
作者:
Y. Luo;A. J. Han Vinck;Yanling Chen

文献摘要

参考文献

相似文献

本文针对线性分组码,引入了两种最优距离轮廓(ODP)来考虑如何构造基码字,然后逐个排除(或包含)基码字,同时在字典顺序(或逆字典顺序)中保持尽可能大的距离轮廓。其目的是通过选择通信和存储系统中的子码来提高系统的容错能力。一种应用是提供一种合适的代码,用于实现码分多址(CDMA)系统的传输格式组合指示符(TFCI)。另一个应用是在光学介质上的地址检索领域。
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.
DOI: 10.1002/9780470669501
发表时间: 2010-09
期刊: --
影响因子: --
作者:
H. Holma;A. Toskala
通讯作者: H. Holma;A. Toskala
DOI: 10.1007/978-1-4615-5745-6_2
发表时间: 1998
期刊: --
影响因子: --
作者:
Shu Lin;T. Kasami;T. Fujiwara;M. Fossorier
通讯作者: Shu Lin;T. Kasami;T. Fujiwara;M. Fossorier
DOI: 10.1109/tit.2005.844056
发表时间: 2004-06
期刊: IEEE Trans. Inf. Theory
影响因子: --
作者:
I. Otung
通讯作者: I. Otung
DOI: 10.1109/isit.2001.936065
发表时间: 2001-06
期刊: Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)
影响因子: --
作者:
M. V. Dijk;S. Baggen;Tolhuizen Ludovicus Marinus Ge
通讯作者: M. V. Dijk;S. Baggen;Tolhuizen Ludovicus Marinus Ge
DOI: 10.1109/18.782160
发表时间: 1999-09
期刊: IEEE Trans. Inf. Theory
影响因子: --
作者:
Jonas Olsson;W. Willems
通讯作者: Jonas Olsson;W. Willems