Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer_journal/enumeration-of-constant-weight-run-length-limited-binary-sequences-8am7v3jCXQ
References (27)
-
S. Golomb (1966)
Run-length encodings. -
D. Knuth (1986)
Efficient balanced codesIEEE Trans. Inf. Theory, 32
-
P. Lee (1988)
Combined Error-Correcting/Modulation Recording Codes -
M. Blaum, R. Cideciyan, E. Eleftheriou, R. Galbraith, K. Lakovic, T. Mittelholzer, T. Oenning, B. Wilson (2007)
Enumerative Encoding with Non-Uniform Modulation Constraints2007 IEEE International Symposium on Information Theory
-
W.H. Kautz (1965)
Fibonacci Codes for Synchronization ControlIEEE Trans. Inform. Theory, 11
-
J. Riordan (1958)
Introduction to Combinatorial Analysis -
S. Datta, S. McLaughlin (1999)
An enumerative method for runlength-limited codes: permutation codesIEEE Trans. Inf. Theory, 45
-
Schouhamer Immink, A. Kees (2004)
Codes for mass data storage systems -
Ieee Transactions on Information Theory Co~tcluding Remarks -
O.F. Kurmaev (2001)
Coding of Run-Length-Limited SequencesProbl. Peredachi Inf., 37
-
B. Ryabko, Yulia Medvedeva (2009)
Fast enumeration of run-length-limited words2009 IEEE International Symposium on Information Theory
-
Kees Immink, P. Siegel, J. Wolf (1998)
Codes for Digital RecordersIEEE Trans. Inf. Theory, 44
-
P.I. Vasil’ev, V.D. Kolesnik (1987)
Pomekhoustoichivoe kodirovanie i nadezhnost’ EVM -
S. Golomb (1966)
Run-length encodings (Corresp.)IEEE Trans. Inf. Theory, 12
-
O. Kurmaev (2002)
Enumerative Coding for Constant-Weight Binary Sequences with Constrained Run-Length of ZerosProblems of Information Transmission, 38
-
O. Kurmaev (2001)
Coding of Run-Length-Limited SequencesProblems of Information Transmission, 37
-
H. Hollmann, Kees Immink (1991)
Schouhamer Immink. Performance of efficient balanced codesIEEE Trans. Inf. Theory, 37
-
Øyvind Ytrehus (1991)
Upper bounds on error-correcting runlength-limited block codesIEEE Trans. Inf. Theory, 37
-
I. Tal, T. Etzion, R. Roth (2008)
On Row-by-Row Coding for 2-D ConstraintsIEEE Transactions on Information Theory, 55
-
T. Cover (1973)
Enumerative source encodingIEEE Trans. Inf. Theory, 19
-
J. Schalkwijk (1972)
An algorithm for source codingIEEE Trans. Inf. Theory, 18
-
J. Weber, Kees Immink (2010)
Knuth's Balanced Codes RevisitedIEEE Transactions on Information Theory, 56
-
O. Kurmaev (2002)
An enumerative method for encoding and decoding constant-weight run-length limited binary sequencesProceedings IEEE International Symposium on Information Theory,
-
J. Moon, Barrett Brickner (1996)
Maximum transition run codes for data storage systemsIEEE Transactions on Magnetics, 32
-
V.F. Babkin (1971)
A Universal Encoding Method with Nonexponential Work Expenditure for a Source of Independent MessagesProbl. Peredachi Inf., 7
-
M. Blaum, K. Lakovic (2007)
Variable Span Fibonacci Modulation Codes with Limited Byte Error Propagation2007 IEEE International Symposium on Information Theory
-
G. Beenker, Kees Immink (1983)
A generalized method for encoding and decoding run-length-limited binary sequencesIEEE Trans. Inf. Theory, 29
- Publisher
- Springer Journals
- Copyright
- Copyright © 2011 by Pleiades Publishing, Ltd.
- Subject
- Engineering; Electrical Engineering; Information Storage and Retrieval; Systems Theory, Control; Communications Engineering, Networks
- ISSN
- 0032-9460
- eISSN
- 1608-3253
- DOI
- 10.1134/S0032946011010078
- Publisher site
- See Article on Publisher Site
Abstract
Constant-weight binary sequences with constrained run lengths of zeros and ones are introduced. These run-length constraints are separate and independent. Using the Babkin-Cover enumerative scheme, the number of these sequences is found. Then enumeration-based encoding and decoding procedures are constructed.
Journal
Problems of Information Transmission – Springer Journals
Published: Apr 19, 2011