Constructing rate 1/p systematic binary quasi-cyclic codes based on the matroid theory
From MaRDI portal
Publication:2439745
DOI10.1007/S10623-012-9715-1zbMATH Open1323.94168OpenAlexW2084314783MaRDI QIDQ2439745FDOQ2439745
Authors: Guangfu Wu, Hsin-Chiu Chang, Lin Wang, Trieu-Kien Truong 
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
Recommendations
Cites Work
- A Mathematical Theory of Communication
- Title not available (Why is that?)
- Matroids and Graphs
- Towards a matroid-minor structure theory
- Using Linear Programming to Decode Binary Linear Codes
- Network information flow
- Transversals and matroid partition
- Networks, Matroids, and Non-Shannon Information Inequalities
- New binary coding results by circulants
- Nine good rate (m-1)/pm quasi-cyclic codes
- On quasi-cyclic codes with rate l m (Corresp.)
- Six new binary quasi-cyclic codes
- Some results on quasi-cyclic codes
- Variations on encoding circuits for stabilizer quantum codes
- Weight Enumeration and the Geometry of Linear Codes
- Some (ink, k) cyclic codes in quasi-cyclic form (Corresp.)
- Self-orthogonal quasi-cyclic codes
- Some rate-<tex>p/(p+1)</tex>quasi-cyclic codes (Corresp.)
- The matroid of supports of a linear code
- Twelve good rate (m-r)/pm quasi-cyclic codes
- Decoding of circulant codes (Corresp.)
- Circulant bases for cyclic codes (Corresp.)
- An updated table of rate \(1/p\) binary quasi-cyclic codes
Cited In (2)
This page was built for publication: Constructing rate \(1/p\) systematic binary quasi-cyclic codes based on the matroid theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2439745)
