مرکز منطقه ای اطلاع رساني علوم و فناوري - Construction of Capacity Achieving <emphasis><formula formulatype="inline"> <img src="/images/tex/962.gif" alt="(M, d, \\infty )"> </formula></emphasis> Constrained Codes With Least Decoder Window Length

DocumentCode :

864601

Title :

Construction of Capacity Achieving $(M, d, \\infty )$ Constrained Codes With Least Decoder Window Length

Author :

Kumar, Ajit ; Schouhamer Immink, Kees A.

Author_Institution :

Electr. & Comput. Eng. Dept., Nat. Univ. of Singapore, Singapore

Volume :

Issue :

fYear :

2008

Firstpage :

4724

Lastpage :

4726

Abstract :

We present capacity achieving multilevel run-length-limited (ML-RLL) codes that can be decoded by a sliding window of size 2.

Keywords :

decoding; runlength codes; capacity achieving construction; constrained codes; least decoder window length; multilevel run-length-limited codes; Array signal processing; Broadcasting; Decoding; Fading; Feedback; Gallium nitride; MIMO; Time division multiple access; Vector quantization; Wireless communication; $(M, d, infty)$ constrained sequences; Channel capacity; run-length-limited sequences;

fLanguage :

English

Journal_Title :

Information Theory, IEEE Transactions on

Publisher :

ieee

ISSN :

0018-9448

Type :

jour

DOI :

10.1109/TIT.2008.928971

Filename :

4626066

Link To Document :

https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=864601