Enumerative maximum-transition-run codes

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 len...

Full description

Saved in:
Bibliographic Details
Main Author: Mittelholzer, T.
Format: Conference Proceeding
Language:English
Subjects:
Binary sequences
Block codes
Encoding
Laboratories
Magnetic recording
Maximum likelihood detection
Modular construction
Modulation coding
Optical modulation
Optical recording
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2157-8095
2157-8117
DOI:10.1109/ISIT.2009.5205833