SPC product codes, graphs with cycles and Kostka numbers
From MaRDI portal
Publication:2331735
DOI10.1007/S13398-019-00698-1zbMATH Open1423.94143OpenAlexW2953315237WikidataQ127655978 ScholiaQ127655978MaRDI QIDQ2331735FDOQ2331735
Authors: Sara D. Cardell, Joan-Josep Climent, Alberto López Martín 
Publication date: 30 October 2019
Published in: Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A: Matemáticas. RACSAM (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10045/95531
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- An approach to the performance of SPC product codes on the erasure channel
- Single parity check product codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graphs, surfaces and homology
- Algorithms for constructing \((0,1)\)-matrices with prescribed row and column sum vectors
Cited In (5)
- An approach to the performance of SPC product codes on the erasure channel
- On nonsingular acyclic M-matrices whose inverse is also acyclic
- Recoverability study of SPC product codes under erasure decoding
- Independence number of graphs and line graphs of trees by means of omega invariant
- SPC product codes over the erasure channel
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)
