Covering properties of convolutional codes and associated lattices

DOI10.1109/18.382019zbMath0834.94017OpenAlexW2132196050MaRDI QIDQ4836900

Asya Rabinovich, Robert Calderbank, Peter C. Fishburn

Publication date: 26 March 1996

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.382019

zbMATH Keywords

dynamic programmingcovering radiusViterbi algorithmconvolutional codesfinite state machinesVoronoi regionexpected performanceMarkov methodstrellis coded quantizationinfinite dimensional binary latticesworst csae performance

Mathematics Subject Classification ID

Combined modulation schemes (including trellis codes) in coding theory (94B12) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Convolutional codes (94B10)

Related Items

Unnamed Item ⋮ On the non-linearity of power functions.