A new description of trellis codes

DOI10.1109/TIT.1984.1056976zbMATH Open0557.94009MaRDI QIDQ3221876FDOQ3221876

Authors: Robert Calderbank, J. E. Mazo 

Publication date: 1984

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

Recommendations

• Asymptotic Upper Bounds on the Minimum Distance of Trellis Codes
• scientific article; zbMATH DE number 3943703
• scientific article; zbMATH DE number 4160652
• New trellis codes based on lattices and cosets
• Trellis Coding for Partial-Response Channels

zbMATH Keywords

noise immunitychannel codingdifferential encoding trellis codesencoding a binary data streamnoisy transmission channel

Mathematics Subject Classification ID

Communication theory (94A05) Channel models (including quantum) in information and communication theory (94A40)

Cited In (12)

• New rotationally invariant four-dimensional trellis codes
• Very low rate trellis/Reed-Muller (TRM) codes
• On the performance evaluation of trellis codes
• Design and analysis of trellis codes for orthogonal signal sets
• A multilevel approach to constructing trellis-matched codes for binary-input partial-response channels
• On the trellis representation of the Delsarte-Goethals codes
• A trellis coding scheme based on signal alphabet splitting
• New trellis codes based on lattices and cosets
• Title not available (Why is that?)
• Asymptotic Upper Bounds on the Minimum Distance of Trellis Codes
• Nonhomogeneous Trellis codes for the Quasi-Synchronous Multiple-Access Binary adder channel with Two Users
• Title not available (Why is that?)

This page was built for publication: A new description of trellis codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3221876)