Complexity of Elias algorithm based on codes with covering radius three

MaRDI QIDQ2932869zbMATH OpenFDO

Authors L. H. Aslanyan, H. E. Danoyan

Publication date 9 December 2014

zbMATH Keywords

nearest neighborshash functionscoset weight distributionuniformly packed codesbest matchEleas algorithmquasiperfect codes

Mathematics Subject Classification ID

Searching and sorting (68P10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• scientific article; zbMATH DE number 4132087
• On computing nearest neighbors with applications to decoding of binary linear codes
• Two decoding algorithms for linear codes
• A New Decoding Algorithm for Complete Decoding of Linear Block Codes
• Decoding complexity of linear block codes

This page was built for publication: Complexity of Elias algorithm based on codes with covering radius three

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