Improved coding techniques for preceded partial-response channels

DOI10.1109/18.312170MaRDI QIDQ4308782zbMATH OpenOpenAlexFDO

Authors Kjell Jørgen Hole, Øyvind Ytrehus

Publication date 11 June 1995

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

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

zbMATH Keywords

convolutional codepartial-response channelstrellis code

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Convolutional codes (94B10) Combined modulation schemes (including trellis codes) in coding theory (94B12)

Recommendations

• Good convolutional codes for the precoded (1-D)(1+D)/sup n/ partial-response channels
• Some convolutional codes whose free distances are maximal
• Trellis Coding for Partial-Response Channels
• Distance spectra of convolutional codes over partial-response channels
• Low-complexity decoding of partial unit memory codes on precoded partial-response channels

Cited in

(8)

• Trellis Coding for Partial-Response Channels
• Binary convolutional codes with application to magnetic recording
• Good convolutional codes for the precoded (1-D)(1+D)/sup n/ partial-response channels
• Low-complexity decoding of partial unit memory codes on precoded partial-response channels
• Distance spectra of convolutional codes over partial-response channels
• Difference set codes: codes with squared Euclidean distance of six for partial response channels
• Cosets of convolutional codes with short maximum zero-run lengths
• Constructions and properties of block codes for partial-response channels

This page was built for publication: Improved coding techniques for preceded partial-response channels

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