Quasi-Enumerative Coding of Balanced Run-Length Limited Codes

Various methods have been proposed for the construction of balanced run-length limited codes. Amongst these methods is the enumerative coding approach by Kurmaev. The advantage of this approach is that the code has maximum cardinality and thus approaches capacity with increasing codeword length. How...

Full description

Saved in:
Bibliographic Details
Published in:IEEE access Vol. 12; pp. 39375 - 39389
Main Authors: Paluncic, Filip, Maharaj, B. T.
Format: Journal Article
Language:English
Published: Piscataway IEEE 2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
balanced codes
Codes
Coding
Complexity
Decoding
Encoding
Enumerative coding
Media
Object recognition
Random variables
run-length limited codes
Symbols
ISSN:2169-3536, 2169-3536
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Various methods have been proposed for the construction of balanced run-length limited codes. Amongst these methods is the enumerative coding approach by Kurmaev. The advantage of this approach is that the code has maximum cardinality and thus approaches capacity with increasing codeword length. However, enumerative coding has the disadvantage of becoming prohibitively complex for large codeword lengths. We propose an alternative enumerative coding method that reduces the encoding and decoding complexity. We call it quasi-enumerative coding as it does not follow a strict lexicographic order, but retains a one-to-one mapping between rank and the corresponding balanced run-length limited codeword.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2024.3376476