Identification of irreducible components of canonical graphs
From MaRDI portal
Publication:1901180
DOI10.1007/BF03167291zbMath0835.94012MaRDI QIDQ1901180
Publication date: 5 November 1995
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Applications of graph theory (05C90) Channel models (including quantum) in information and communication theory (94A40) Source coding (94A29)
Cites Work
- Unnamed Item
- Ergodic theory on compact spaces
- Codes for zero spectral density at zero frequency (Corresp.)
- Sofic systems and encoding data
- On codes with spectral nulls at rational submultiples of the symbol frequency
- Algorithms for sliding block codes - An application of symbolic dynamics to information theory
- Irreducible components of canonical diagrams for spectral nulls
This page was built for publication: Identification of irreducible components of canonical graphs