Asymptotically good codes have infinite trellis complexity
The trellis complexity s(C) of a block code C is defined as the logarithm of the maximum number of states in the minimal trellis realization of the code. The parameter s(C) gove...
Publications
1 shownFrequent Co-Authors
Researcher Info
- h-index
- 1
- Publications
- 1
- Citations
- 44
- Institution
- University of Illinois Urbana-Champaign
External Links
Identifiers
- ORCID
- 0000-0003-3303-9078
Impact Metrics
h-index
1
h-index: Number of publications with at least h citations each.