On the rectangularity of nonlinear block codes

DOI10.1109/18.749021zbMATH Open0945.94027OpenAlexW2169697285MaRDI QIDQ4701322FDOQ4701322

Authors: V. R. Sidorenko, Ian Martin, B. Honary 

Publication date: 21 November 1999

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

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

Recommendations

• scientific article; zbMATH DE number 1498826
• scientific article; zbMATH DE number 2154143
• scientific article; zbMATH DE number 1504670
• scientific article; zbMATH DE number 1424164

zbMATH Keywords

nonlinear codesHadamard codesrectangularityDelsarte-Goethals codesKerdock codesNordstrom-Robinson codeLevenshtein codespermutation-rectangularrectangular codeunique minimal trellis

Mathematics Subject Classification ID

Other types of codes (94B60)

Cited In (5)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An approach to Ungerboeck coding for rectangular signal sets (Corresp.)

This page was built for publication: On the rectangularity of nonlinear block codes

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