Product construction of affine codes

DOI10.1137/140976996MaRDI QIDQ2944459zbMATH OpenOpenAlexFDO

Authors Yeow Meng Chee, Han Mao Kiah, Punarbasu Purkayastha, Patrick Solé

Publication date 2 September 2015

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1506.03724, https://hdl.handle.net/10356/81007

zbMATH Keywords

product codesaffine codespower line communicationsirregular product codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Burst-correcting codes (94B20) Other types of codes (94B60)

Abstract: Binary matrix codes with restricted row and column weights are a desirable method of coded modulation for power line communication. In this work, we construct such matrix codes that are obtained as products of affine codes - cosets of binary linear codes. Additionally, the constructions have the property that they are systematic. Subsequently, we generalize our construction to irregular product of affine codes, where the component codes are affine codes of different rates.

Recommendations

• New linear codes from matrix-product codes with polynomial units
• Construction and bound on the performance of matrix-product codes
• scientific article; zbMATH DE number 2185736
• On the weight enumerator of product codes
• scientific article; zbMATH DE number 5903167

Cites work

• scientific article; zbMATH DE number 3485627 (Why is no real title available?)
• scientific article; zbMATH DE number 3555872 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1284436 (Why is no real title available?)
• Constructing Coset Codes With Optimal Same-Symbol Weight for Detecting Narrowband Interference in $M$-FSK Systems
• Error and erasure correcting algorithms for rank codes
• Low Complexity Two-Dimensional Weight-Constrained Codes
• Product construction of affine codes
• The Grey-Rankin bound for nonbinary codes
• Two-dimensional weight-constrained codes through enumeration bounds

Cited in

(5)

• A simple suboptimal construction of cross-bifix-free codes
• Product construction of affine codes
• Product and interleaving of anticodes
• Code Construction on Fiber Products of Kummer Covers
• scientific article; zbMATH DE number 5903167 (Why is no real title available?)

This page was built for publication: Product construction of affine codes

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