Product construction of affine codes
From MaRDI portal
Publication:2944459
DOI10.1137/140976996zbMATH Open1344.94087arXiv1506.03724OpenAlexW2539817661MaRDI QIDQ2944459FDOQ2944459
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)
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.
Full work available at URL: https://arxiv.org/abs/1506.03724
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Error and erasure correcting algorithms for rank codes
- Title not available (Why is that?)
- The Grey-Rankin bound for nonbinary codes
- Two-dimensional weight-constrained codes through enumeration bounds
- Low Complexity Two-Dimensional Weight-Constrained Codes
- Product Construction of Affine Codes
- Constructing Coset Codes With Optimal Same-Symbol Weight for Detecting Narrowband Interference in $M$-FSK Systems
Cited In (5)
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)