Mixed polarized constructions

DOI10.1504/IJICOT.2015.072611MaRDI QIDQ274527zbMATH OpenOpenAlexFDO

Authors I. I. Dumer

Publication date 22 April 2016

Published in International Journal of Information and Coding Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/ijicot.2015.072611

zbMATH Keywords

Boolean polynomialsmaximum likelihood decodingpolar codesrecursive decodingReed-Muller codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Review text

Summary: We consider Plotkin-type constructions that perform a multi-step recursive decomposition of a given code into the shorter codes and are similar to polar and Reed-Muller (RM) codes. However, we end this decomposition process at the various short codes instead of the single information bits used as end nodes in polar design. We also employ maximum likelihood (ML) decoding of the end codes. Such a design can reduce the output error rates of polarised constructions on the moderate blocklengths. We also analyse the complexity-performance trade-offs in order to optimise code design.

Recommendations

• Polarized subtyping
• Multi-polar aggregation
• A generalization of the notion of polarization
• Polarization and isogenies
• Random polarizations
• Polarization identities
• Pluri-polarity in almost complex structures
• Mixed polytopes
• Remarks on polarity designs

Cited in

(2)

• Polarized Substructural Session Types
• Recursive descriptions of polar codes

This page was built for publication: Mixed polarized constructions

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