Revisiting the linear information flow algorithm

DOI10.1504/IJICOT.2013.059703MaRDI QIDQ477998zbMATH OpenOpenAlexFDO

Authors Russell Higgs

Publication date 10 December 2014

Published in International Journal of Information and Coding Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/ijicot.2013.059703

zbMATH Keywords

information theorycoding theoryalphabet sizeLIF algorithm

Mathematics Subject Classification ID

Applications of graph theory (05C90) Linear codes (general theory) (94B05)

Recommendations

• Insufficiency of Linear Coding in Network Information Flow
• Linear network coding
• Polynomial Time Algorithms for Multicast Network Code Construction
• Complexity classification of network information flow problems
• Polynomial-Time Construction of Linear Network Coding

Cited in

(3)

• scientific article; zbMATH DE number 7308469 (Why is no real title available?)
• The Liang-Kleeman information flow: theory and applications
• Linear decomposition method in analyzing hidden information protocols on algebraic platforms

This page was built for publication: Revisiting the linear information flow algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477998)