Constructing rate \(1/p\) systematic binary quasi-cyclic codes based on the matroid theory
From MaRDI portal
Publication:2439745
DOI10.1007/s10623-012-9715-1zbMath1323.94168MaRDI QIDQ2439745
Lin Wang, Trieu-Kien Truong, Guangfu Wu, Hsin-Chiu Chang
Publication date: 17 March 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-012-9715-1
Cites Work
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- The matroid of supports of a linear code
- An updated table of rate \(1/p\) binary quasi-cyclic codes
- Variations on Encoding Circuits for Stabilizer Quantum Codes
- Matroids and Graphs
- Using Linear Programming to Decode Binary Linear Codes
- Networks, Matroids, and Non-Shannon Information Inequalities
- Nine good rate (m-1)/pm quasi-cyclic codes
- Weight Enumeration and the Geometry of Linear Codes
- On quasi-cyclic codes with rate l m (Corresp.)
- Some (ink, k) cyclic codes in quasi-cyclic form (Corresp.)
- Twelve good rate (m-r)/pm quasi-cyclic codes
- Six new binary quasi-cyclic codes
- Network information flow
- Some rate-<tex>p/(p+1)</tex>quasi-cyclic codes (Corresp.)
- Transversals and matroid partition
- Self-orthogonal quasi-cyclic codes
- New binary coding results by circulants
- Some results on quasi-cyclic codes
- Decoding of circulant codes (Corresp.)
- Circulant bases for cyclic codes (Corresp.)