NDLI: A fixed-rate bit stuffing approach for high efficiency k-constrained codes

Content Provider	IEEE Xplore Digital Library
Author	Sankarasubramaniam, Y. McLaughlin, S.W.
Copyright Year	2005
Description	Author affiliation: Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA (Sankarasubramaniam, Y.; McLaughlin, S.W.)
Abstract	Binary sequences where successive ones are separated by at most k consecutive zeros, are said to be k-constrained. We introduce a new fixed-rate algorithm for efficiently encoding and decoding k-constrained sequences. Our approach is based on bit stuffing proposed by Bender and Wolf. Bit stuffing is a simple algorithm that can produce near-optimal codes for a wide range of constraints. While bit stuffing achieves rates very close to the noiseless capacity, encoding is variable-rate, which severely limits its practical use. In this paper, we present a fixed-rate version of the bit stuff algorithm. High encoding efficiency is achieved by iterative pre-processing of the fixed-length input data to conform it to bit insertion. The encoder then inserts bits to produce a fixed-length output word. Rate computations for the proposed encoding algorithm are discussed, and upper and lower bounds are derived for the asymptotic (in input block length) encoding rate. It is seen that encoding rates very close to the average bit stuff rate are possible with long, fixed-length, input and output blocks. Upper and lower bounds on the asymptotic encoding rate are listed for values of k = 1 to 15
Starting Page	543
Ending Page	547
File Size	190986
Page Count	5
File Format	PDF
ISBN	0780391519
DOI	10.1109/ISIT.2005.1523394
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2005-09-04
Publisher Place	Australia
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Encoding Iterative algorithms Magnetic recording Binary sequences Decoding Communication channels History Equations Algorithm design and analysis Fluctuations
Content Type	Text
Resource Type	Article

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

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

An improvement to the bit stuffing algorithm

On the efficiency of some suboptimal algorithms for bit decoding of binary codes

An iterative soft-decision decoding algorithm for conventional concatenated codes

A Reliability-Based Reed-Solomon Decoding Algorithm for Magnetic Recording Channels

Reduced-complexity iterative decoding of high-rate turbo codes

Turbo like decoding of LDPC codes

A simple parity check matrix LDPC code for perpendicular magnetic recording channels

Turbo codes for binary symmetric and binary erasure channels

A fixed-rate bit stuffing approach for high efficiency k-constrained codes

Similar Documents

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

An improvement to the bit stuffing algorithm

On the efficiency of some suboptimal algorithms for bit decoding of binary codes

An iterative soft-decision decoding algorithm for conventional concatenated codes

A Reliability-Based Reed-Solomon Decoding Algorithm for Magnetic Recording Channels

Reduced-complexity iterative decoding of high-rate turbo codes

Turbo like decoding of LDPC codes

A simple parity check matrix LDPC code for perpendicular magnetic recording channels

Turbo codes for binary symmetric and binary erasure channels

A fixed-rate bit stuffing approach for high efficiency k-constrained codes