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

Complexity of decoding for linear codes

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

zbMath0522.94015MaRDI QIDQ1056724

G. S. Evseev

Publication date: 1983

Published in: Problems of Information Transmission (Search for Journal in Brave)


zbMATH Keywords

complexity of decodingdecoding of binary linear codesQ-decoding


Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35) Error probability in coding theory (94B70)


Related Items (2)

New approaches to reduced-complexity decoding ⋮ On the complexity of suboptimal decoding for list and decision feedback schemes




This page was built for publication: Complexity of decoding for linear codes

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