SPC product codes, graphs with cycles and Kostka numbers
From MaRDI portal
(Redirected from Publication:2331735)
Recommendations
- Cyclic mappings of product codes (Corresp.)
- New results of identifying codes in product graphs
- Special \textit{LCD} codes from products of graphs
- Identifying codes in the direct product of a complete graph and some special graphs
- Identifying codes of lexicographic product of graphs
- PRODUCTS OF CIRCULANT GRAPHS
- Cyclotomic graphs and perfect codes
- The Sierpiński product of graphs
- Perfect codes in some products of graphs
- scientific article; zbMATH DE number 1926055
Cites work
- scientific article; zbMATH DE number 46849 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- scientific article; zbMATH DE number 5065241 (Why is no real title available?)
- Algorithms for constructing \((0,1)\)-matrices with prescribed row and column sum vectors
- An approach to the performance of SPC product codes on the erasure channel
- Graphs, surfaces and homology
- Single parity check product codes
Cited in
(5)- Recoverability study of SPC product codes under erasure decoding
- SPC product codes over the erasure channel
- On nonsingular acyclic M-matrices whose inverse is also acyclic
- An approach to the performance of SPC product codes on the erasure channel
- Independence number of graphs and line graphs of trees by means of omega invariant
This page was built for publication: SPC product codes, graphs with cycles and Kostka numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2331735)