A new lower bound for the computational cutoff rate of a binary symmetric channel having an input runlength-limited constraint is derived. Our result outperforms the existing lower bound.
Inspec keywords: runlength codes; telecommunication channels
Other keywords:
Subjects: Codes
References
-
-
1)
- B.H. Marcus , P.H. Siegel , J.K. Wolf . Finite-state modulation codes for data storage. IEEE J. Sel. Areas Commun. , 1 , 5 - 37
-
2)
- J.L. Massey . Capacity, cutoff rate, and coding for a direct-detection optical channel. IEEE Trans. , 11 , 1615 - 1621
-
3)
- K.A. Schouhamer Immink . (1991) Coding techniques for digital recorders.
-
4)
- V.D. Kolesnik , Krachkovsky . Generating functions and lower bounds on rates for limited error-correctingcodes. IEEE Trans. , 3 , 778 - 788
-
5)
- S.A. Raghavan , J.K. Wolf , L.B. Milstein . On the cutoff rate of a discrete memoryless channel with (d,k)-constrained input sequences. IEEE J. Sel. Areas Commun. , 1 , 233 - 241
-
6)
- P.H. Siegel , J.K. Wolf . Modulation and coding for information storage. IEEE Commun. Mag. , 12 , 68 - 86
-
7)
- A.J. Viterbi , J.K. Omura . (1979) Principles of digital communications and coding.
-
8)
- Massey, J.L.: `Coding and modulation in digital communications', Proc. Int. Zurich Sem. Digital Commun., March 1974.
-
9)
- D.E. Lazić , V. Šenk . A direct geometrical method for bounding the error exponent for any specificfamily of channel codes - Part I: Cutoff rate lower bound for block codes. IEEE Trans. , 4 , 1548 - 1559
-
1)
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19951252
Related content
content/journals/10.1049/el_19951252
pub_keyword,iet_inspecKeyword,pub_concept
6
6