Covering properties of convolutional codes and associated lattices
Authors:
- A.R. CalderbankACA.R. Calderbank
- P.C. FishburnPFP.C. Fishburn
- A. RabinovichARA. Rabinovich
- 1 May 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 41 (3) , 732-746
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Trellis shapingIEEE Transactions on Information Theory, 1992
- Finite-state modulation codes for data storageIEEE Journal on Selected Areas in Communications, 1992
- Trellis coded quantization of memoryless and Gauss-Markov sourcesIEEE Transactions on Communications, 1990
- Coset codes. II. Binary lattices and related codesIEEE Transactions on Information Theory, 1988
- Sphere Packings, Lattices and Groups1988
- New trellis codes based on lattices and cosetsIEEE Transactions on Information Theory, 1987
- Covering radius---Survey and recent resultsIEEE Transactions on Information Theory, 1985
- On the covering radius of codesIEEE Transactions on Information Theory, 1985
- Asymptotic Upper Bounds on the Minimum Distance of Trellis CodesIEEE Transactions on Communications, 1985
- A fast encoding method for lattice codes and quantizersIEEE Transactions on Information Theory, 1983