Constructing rate 1/p systematic binary quasi-cyclic codes based on the matroid theory
From MaRDI portal
Publication:2439745
Recommendations
Cites work
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- A Mathematical Theory of Communication
- An updated table of rate 1/p binary quasi-cyclic codes
- Circulant bases for cyclic codes (Corresp.)
- Decoding of circulant codes (Corresp.)
- Matroids and Graphs
- Network information flow
- 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.)
- Self-orthogonal quasi-cyclic codes
- Six new binary quasi-cyclic codes
- Some (ink, k) cyclic codes in quasi-cyclic form (Corresp.)
- Some rate-<tex>p/(p+1)</tex>quasi-cyclic codes (Corresp.)
- Some results on quasi-cyclic codes
- The matroid of supports of a linear code
- Towards a matroid-minor structure theory
- Transversals and matroid partition
- Twelve good rate (m-r)/pm quasi-cyclic codes
- Using Linear Programming to Decode Binary Linear Codes
- Variations on encoding circuits for stabilizer quantum codes
- Weight Enumeration and the Geometry of Linear 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)