DocumentCode
2988000
Title
Enumerative maximum-transition-run codes
Author
Mittelholzer, Thomas
Author_Institution
IBM Zurich Res. Lab., Ruschlikon, Switzerland
fYear
2009
fDate
June 28 2009-July 3 2009
Firstpage
1549
Lastpage
1553
Abstract
A new class of maximum-transition-run (MTR) block codes is presented which is based on a novel enumerative encoding scheme to construct codes with predetermined j and k constraints. These MTR codes are a generalization of Fibonacci codes, and they share a similar optimality property: For a given length N, they contain the maximum number of length-N codewords satisfying the (j, k) constraint. Furthermore, by using a slight modification of the code construction, one obtains practical high-rate modulation codes with limited error propagation.
Keywords
block codes; Fibonacci codes; code construction; high-rate modulation codes; maximum-transition-run block codes; novel enumerative encoding scheme; slight modification; Binary sequences; Block codes; Encoding; Laboratories; Magnetic recording; Maximum likelihood detection; Modular construction; Modulation coding; Optical modulation; Optical recording;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Conference_Location
Seoul
Print_ISBN
978-1-4244-4312-3
Electronic_ISBN
978-1-4244-4313-0
Type
conf
DOI
10.1109/ISIT.2009.5205833
Filename
5205833
Link To Document