Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Low density parity check codes based on sparse matrices with no small cycles

From MaRDI portal
Publication:4400562
Jump to:navigation, search

DOI10.1007/BFb0024448zbMath0919.94051OpenAlexW1499248328MaRDI QIDQ4400562

Stefen Hui, Hank Schmidt, James W. Bond

Publication date: 25 August 1999

Published in: Crytography and Coding (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0024448


zbMATH Keywords

linear codesregular graphsbipartite graphsgirth of a graphKronecker product of matricesrandom sparse matricesuniform sparse matrices


Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Linear codes (general theory) (94B05)



Uses Software

  • Matlab






This page was built for publication: Low density parity check codes based on sparse matrices with no small cycles

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4400562&oldid=18418037"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 7 February 2024, at 01:40.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki