scientific article; zbMATH DE number 837790

MaRDI QIDQ4863699zbMATH OpenFDO

Authors Joan Feigenbaum

Publication date 15 September 1996

zbMATH Keywords

coding theorycomputational complexity

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Linear codes (general theory) (94B05)

Recommendations

• Some Applications of Coding Theory in Computational Complexity
• scientific article; zbMATH DE number 1559526
• scientific article; zbMATH DE number 1104164
• scientific article; zbMATH DE number 1759459
• scientific article; zbMATH DE number 2011836

Cited in

(7)

• Decoding of Reed Solomon codes beyond the error-correction bound
• Algebraic testing and weight distributions of codes.
• Computing statistics for polynomial codes: an algorithm based on the Mann-Whitney U-test
• scientific article; zbMATH DE number 1335886 (Why is no real title available?)
• scientific article; zbMATH DE number 1008507 (Why is no real title available?)
• scientific article; zbMATH DE number 1559526 (Why is no real title available?)
• Some Applications of Coding Theory in Computational Complexity

This page was built for publication:

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