Error and erasure control (d,k) block codes

Ferreira, H.C.; Lin, Shang-Ping

doi:10.1109/18.133257

Cited by 19 publications

(12 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This affects only A m δ and A m δ . Indeed, from (15) it follows that index of summation, which subtracts from n and from δ/2, annihilates in (18) and (19) and remains in (16) and (17).…”

Section: B Calculating the Number Of Constant-charge Sequencesmentioning

confidence: 99%

See 1 more Smart Citation

Constant-Weight and Constant-Charge Binary Run-Length Limited Codes

Kurmaev

2011

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Constant-weight and constant-charge binary sequences with constrained run length of zeros are introduced. For these sequences, the weight and the charge distribution are found. Then, recurrent and direct formulas for calculating the number of these sequences are obtained. With considering these numbers of constant-weight and constant-charge RLL sequences as coefficients of convergent power series, generating functions are derived. The fact, that generating function for enumerating constant-charge RLL sequences does not have a closed form, is proved. Implementation of encoding and decoding procedures using Cover's enumerative scheme is shown. On the base of obtained results, some examples, such as enumeration of running-digital-sum (RDS) constrained RLL sequences or peak-shifts control capability are also provided.

show abstract

Section: B Calculating the Number Of Constant-charge Sequencesmentioning

confidence: 99%

“…Note, that practical applications of the generating functions for enumerating RLL sequences often require a rational expression. Ferreira and Lin [19] and some other authors [4], [7] obtained a generating function for enumerating dk and dkr sequences…”

Section: Ementioning

confidence: 99%

Constant-Weight and Constant-Charge Binary Run-Length Limited Codes

Kurmaev

2011

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

show abstract

“…Ferreira and Lin, in [50], developed an entirely different approach to the problem of putting error-correcting ability into a set of (d, k) codewords. Their idea was to think of each constrained n-tuple not just as a string of bits but as a string of integers representing the runlengths of zeroes contained in the word.…”

Section: Ferreira and Lin-integer Compositionsmentioning

confidence: 99%

Error-correcting two-dimensional modulation codes

Erxleben

Marcellin

1995

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

LIST OF TABLES 1.1. Existing codes 3.1. 2x3 words satisfying the (1,3) constraint 73 3.2. 2x4 words satisfying the (1,3) constraint and ending with zeroes on both tracks 3.3. Fibonacci numbers and powers of two 3.4. 2x5 codewords grouped into pairs with intrapair distance 6 3.5. Eight disjoint foursomes of even-weight 2x6 words with intrafoursome distance >6 3.6. A set of 32 disjoint pairs of 2 x 6 codewords with intrapair distance >6 3.7. A set of 32 disjoint foursomes of even-weight 2x7 codewords with intrafoursome distance >6 3.8. A set of 32 disjoint foursomes of odd-weight 2x7 codewords with intrafoursome distance >6 3.9. The 3x2 codewords 3.10. The 4x2 codewords 3.11. Parameters of n x 2 codes for 3 < n < 9

show abstract

“…In [5], it was proposed that the Hamming subcode block length is kept as large as possible to avoid rate loss for a single-error correcting ECC/RLL code. In [6], redundancy based on appended parity bits is used, or access to channel-side information is possible and sufficiently long † The author is currently with Agere Systems, Milpitas, CA 95035, USA; Email: abessios@agere.com. codewords are assumed, to construct high rate codes with single error correction capability.…”

Section: Introductionmentioning

confidence: 99%

“…These are (d = 0, k) codes, where d and k denote, respectively, the minimum and maximum run-length of zeros between ones in an unprecoded channel data stream. There are several RLL codes with or without enhanced error control capabilities [1,2,3,4,5,6,7,8,9,10]. The (d = 0, k/I) RLL codes use gated-partition logic to achieve high rates such as 8/9 [1] and 16/17 [2], while focusing on the k, I (interleave) constraints.…”

Section: Introductionmentioning

confidence: 99%

A Class of High-Rate"Equation missing" Low-Complexity Error-Detecting RLL Codes

Bessios

2001

EURASIP J. Adv. Signal Process.

View full text Add to dashboard Cite

We present a new methodology for the construction of high-rate channel modulation run-length-limited RLL(0, k) codes. Simple modulation encoders and decoders are constructed, with low error propagation during decoding. They combine partial error detection capability (PED) to boost the performance of a concatenated outer Error Correction Code (ECC) (Blaum, 1991). Moreover, current systems are using low redundancy ECC, and the overall rate is mainly determined by the inner modulation code rate, which critically is to be maintained high. Code rates

show abstract

Error and erasure control (d,k) block codes

Cited by 19 publications

References 13 publications

Constant-Weight and Constant-Charge Binary Run-Length Limited Codes

Constant-Weight and Constant-Charge Binary Run-Length Limited Codes

Error-correcting two-dimensional modulation codes

A Class of High-Rate"Equation missing" Low-Complexity Error-Detecting RLL Codes

Contact Info

Product

Resources

About