NDLI: Fixed-Rate Maximum-Runlength-Limited Codes From Variable-Rate Bit Stuffing

Content Provider	IEEE Xplore Digital Library
Author	Sankarasubramaniam, Y. McLaughlin, S.W.
Copyright Year	1963
Abstract	We introduce the fixed-rate bit stuff (FRB) algorithm for efficiently encoding and decoding maximum-runlength-limited (MRL) sequences. Our approach is based on a simple, variable-rate technique called bit stuffing. Bit stuffing produces near-capacity achieving codes for a wide range of constraints, but encoding is variable-rate, which is unacceptable in most applications. In this work, we design near-capacity fixed-rate codes using a three-step procedure. The fixed-length input data block first undergoes iterative preprocessing, followed by variable-rate bit stuffing, and finally dummy-bit padding to a fixed output length. The iterative preprocessing is key to achieving high encoding rates. We discuss rate computation for the proposed FRB algorithm and show that the asymptotic (in input block length) encoding rate is close to the average rate of the variable-rate bit stuff code. Then, we proceed to explore the effect of decreasing/increasing the number of preprocessing iterations. Finally, we derive a lower bound on the encoding rate with finite-length input blocks and tabulate the parameters required to design FRB codes with rate close to 100/101 and 200/201.
Sponsorship	IEEE Information Theory Society
Starting Page	2769
Ending Page	2790
Page Count	22
File Size	668244
File Format	PDF
ISSN	00189448
Volume Number	53
Issue Number	8
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2007-08-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Magnetic recording Magnetization Binary sequences Decoding Data preprocessing Iterative algorithms Magnetic properties Data mining Timing Magnetic materials fixed-rate codes Bit stuffing constrained coding
Content Type	Text
Resource Type	Article
Subject	Library and Information Sciences Information Systems Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

High-Rate Maximum Runlength Constrained Coding Schemes Using Nibble Replacement

An enumerative coding technique for DC-free runlength-limited sequences

Runlength limited codes for single error-detection and single error-correction with mixed type errors

Bounds on the Rate of 2-D Bit-Stuffing Encoders

A new approach to constructing optimal block codes for runlength-limited channels

Optimal Parsing Trees for Run-Length Coding of Biased Data

Tradeoff functions for constrained systems with unconstrained positions

Variable-length state splitting with applications to average runlength-constrained (ARC) codes

Upper bounds on error-correcting runlength-limited block codes

Fixed-Rate Maximum-Runlength-Limited Codes From Variable-Rate Bit Stuffing

Similar Documents

High-Rate Maximum Runlength Constrained Coding Schemes Using Nibble Replacement

An enumerative coding technique for DC-free runlength-limited sequences

Runlength limited codes for single error-detection and single error-correction with mixed type errors

Bounds on the Rate of 2-D Bit-Stuffing Encoders

A new approach to constructing optimal block codes for runlength-limited channels

Optimal Parsing Trees for Run-Length Coding of Biased Data

Tradeoff functions for constrained systems with unconstrained positions

Variable-length state splitting with applications to average runlength-constrained (ARC) codes

Upper bounds on error-correcting runlength-limited block codes

Fixed-Rate Maximum-Runlength-Limited Codes From Variable-Rate Bit Stuffing