A multilevel approach to constructing trellis-matched codes for binary-input partial-response channels

DOI10.1109/18.796410MaRDI QIDQ4503463zbMATH OpenOpenAlexFDO

Authors Bartolomeu F. Uchôa-Filho, Mark A. Herro, Daniel J. jun. Costello

Publication date 7 September 2000

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

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

zbMATH Keywords

binary-input partial-response channelsdecoder trellismultilevel codingtrellis-matched codes

Mathematics Subject Classification ID

Modulation and demodulation in information and communication theory (94A14) Combined modulation schemes (including trellis codes) in coding theory (94B12)

Recommendations

• Trellis Coding for Partial-Response Channels
• Good convolutional codes for the precoded (1-D)(1+D)/sup n/ partial-response channels
• New trellis codes based on lattices and cosets
• A new description of trellis codes
• Matched spectral-null codes for partial-response channels

Cited in

(3)

• A systematic approach to the construction of bandwidth-efficient multidimensional trellis codes
• Trellis Coding for Partial-Response Channels
• Analysis and design of trellis codes optimized for a binary symmetric Markov source with MAP detection

This page was built for publication: A multilevel approach to constructing trellis-matched codes for binary-input partial-response channels

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