Distance-spectrum formulas on the largest minimum distance of block codes

檔案

日期

2000-05-01

類型

期刊名稱

IEEE TRANSACTIONS ON INFORMATION THEORY

卷期與頁次

第 46 卷第 3 期,頁 869–885

ISSN

0018-9448

語言

英文

摘要

A general formula for the asymptotic largest minimum distance (in block length) of deterministic block codes under generalized distance functions (not necessarily additive, symmetric, and bounded) is presented. As revealed in the formula, the largest minimum distance can be fully determined by the ultimate statistical characteristics of the normalized distance function evaluated under a properly chosen random-code generating distribution. Interestingly, the new formula has an analogous form to the general information-spectrum expressions of the channel capacity and the optimistic channel capacity, respectively derived by Verdu-Han [29] and Chen-Alajaji [7], [8], As a result, a minor class of distance functions for which the largest minimum distance can be derived is characterized. A general Varshamov-Gilbert lower bound is next addressed. Some discussions on the tightness of the general Varshamov-Gilbert bound are also provided. Finally, lower bounds on the largest minimum distances for several specific block coding schemes are rederived in terms of the new formulas, followed by comparisons with the known results devoted to the same codes.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Chen, P., Lee, T., & Han, Y. (2000). Distance-spectrum formulas on the largest minimum distance of block codes. IEEE TRANSACTIONS ON INFORMATION THEORY, 46(3), 869–885. https://doi.org/10.1109/18.841167

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/30534