Using combinatorial optimization to design good unit-memory convolutional codes

DOI10.1109/18.256525MaRDI QIDQ4277182zbMATH OpenOpenAlexFDO

Authors Amir Said, Reginaldo jun. Palazzo

Publication date 6 March 1994

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

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

zbMATH Keywords

combinatorial optimizationunit-memory convolutional codescolumn matching problemcolumn selection problem

Mathematics Subject Classification ID

Convolutional codes (94B10)

Recommendations

• scientific article; zbMATH DE number 1714666
• A directed search approach for unit-memory convolutional codes
• Quasi-cyclic unit memory convolutional codes
• Design and decoding of optimal high-rate convolutional codes
• On unit constraint-length convolutional codes

Cited in

(4)

• Design of extended dense coding protocol strategy based on combinatorial optimization
• Design and decoding of optimal high-rate convolutional codes
• Construction of partial unit-memory convolutional codes based on Reed-Muller codes
• New bounds for \(n_{4}(k,d)\) and classification of some optimal codes over GF(4)

This page was built for publication: Using combinatorial optimization to design good unit-memory convolutional codes

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