Variable-Length Constrained Sequence Codes

被引：12

作者：

Steadman, Andrew ^{[1
]}

Fair, Ivan ^{[1
]}

机构：

[1] Univ Alberta, Dept Elect & Comp Engn, Edmonton, AB T6G 2M7, Canada

来源：

IEEE COMMUNICATIONS LETTERS | 2013年 / 17卷 / 01期

基金：

加拿大自然科学与工程研究理事会;

关键词：

Codes; digital communication; disk recording; Huffman codes;

D O I：

10.1109/LCOMM.2012.120312.121420

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

We outline the construction of simple, high rate constrained sequence codes with variable-length source words and variable-length codewords based on the search of partial extensions of a minimal set of codeword lengths. We present optimal word length mappings for a subset of constrained sequence codes, and provide examples of (d, k) and DC-free codes with few codewords and average code rates greater than 99% of capacity.

引用

页码：139 / 142

页数：4

共 9 条

[1]

[Anonymous], 2004, Codes for Mass Data Storage Systems

[2]

Bocherer G., 2011, GEOMETRIC HUFFMAN CO

[3]

Bocherer G., P 2011 DAT COMPR C

[4] A METHOD FOR THE CONSTRUCTION OF MINIMUM-REDUNDANCY CODES [J].

HUFFMAN, DA .

PROCEEDINGS OF THE INSTITUTE OF RADIO ENGINEERS, 1952, 40 (09) :1098-1101

[5]

IMMINK KAS, 1983, PHILIPS J RES, V38, P138

[6] RUNLENGTH CODES FROM SOURCE CODES [J].

KERPEZ, KJ .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (03) :682-687

[7] ARITHMETIC CODES FOR CONSTRAINED CHANNELS [J].

MARTIN, GNN ;

LANGDON, GG ;

TODD, SJP .

IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1983, 27 (02) :94-106

[8] A MATHEMATICAL THEORY OF COMMUNICATION [J].

SHANNON, CE .

BELL SYSTEM TECHNICAL JOURNAL, 1948, 27 (03) :379-423

[9]

Steadman A., 2011, THESIS U ALBERTA

← 1 →