Information-set decoding for convolutional codes

DOI10.1007/S10623-025-01649-1MaRDI QIDQ6918239zbMATH OpenFDO

Authors Niklas Gassner, Julia Lieb, Abhinaba Mazumder, Michael Schaller

Publication date 10 October 2025

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10623-025-01649-1

zbMATH Keywords

coding theoryconvolutional codescryptographyinformation-set decoding

Mathematics Subject Classification ID

Cryptography (94A60) Convolutional codes (94B10) Decoding (94B35) Error probability in coding theory (94B70)

Cites work

• An efficient attack of a McEliece cryptosystem variant based on convolutional codes
• Concise Encyclopedia of Coding Theory
• Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
• Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
• scientific article; zbMATH DE number 997340 (Why is no real title available?)
• scientific article; zbMATH DE number 4070796 (Why is no real title available?)
• scientific article; zbMATH DE number 4112524 (Why is no real title available?)
• Information and communications security. 14th international conference, ICICS 2012, Hong Kong, China, October 29--31, 2012. Proceedings
• Information-set decoding for linear codes over F_q
• Smaller decoding exponents: ball-collision decoding
• The Magma algebra system. I: The user language
• The tail of the hypergeometric distribution
• Variations of the McEliece cryptosystem

This page was built for publication: Information-set decoding for convolutional codes

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