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
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

On two probabilistic decoding algorithms for binary linear codes

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

DOI10.1109/18.104339zbMath0742.94022OpenAlexW2132034591MaRDI QIDQ3987473

Miodrag Živković

Publication date: 28 June 1992

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/a5b20154373934a630420a33c5e58e5b192b1d7e


zbMATH Keywords

linear codecosetsprobabilistic decodinglow- density parity-check codesSullivan inequality


Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)


Related Items (1)

Discrete optimisation and fast correlation attacks







This page was built for publication: On two probabilistic decoding algorithms for binary linear codes

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3987473&oldid=12045514"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 00:08.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki