[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications
DOI: 10.1109/icc.1992.268102
|View full text |Cite
|
Sign up to set email alerts
|

Runlength limited codes and sequences for binary asymmetrical channels

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
3
3

Relationship

1
5

Authors

Journals

citations
Cited by 7 publications
(1 citation statement)
references
References 4 publications
0
1
0
Order By: Relevance
“…Thus the above Theorem is a special case where by just choosing the correct runlength constraints it is possible to obtain spectral nulls at rational submultiples of the symbol frequency. As an illustration of this Theorem the write spectrum for maxentropic (1,2,3,2), (1, 3, 5, 3) and (2, 5, 4, 5) sequences is given in Fig. 1.…”
Section: Theoremmentioning
confidence: 98%
“…Thus the above Theorem is a special case where by just choosing the correct runlength constraints it is possible to obtain spectral nulls at rational submultiples of the symbol frequency. As an illustration of this Theorem the write spectrum for maxentropic (1,2,3,2), (1, 3, 5, 3) and (2, 5, 4, 5) sequences is given in Fig. 1.…”
Section: Theoremmentioning
confidence: 98%