scientific article; zbMATH DE number 837790

zbMATH Open0845.68058MaRDI QIDQ4863699FDOQ4863699

Authors: Joan Feigenbaum 

Publication date: 15 September 1996

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

computational complexitycoding theory

Mathematics Subject Classification ID

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

Cited In (5)

• Title not available (Why is that?)
• Computing statistics for polynomial codes: an algorithm based on the Mann-Whitney U-test
• Decoding of Reed Solomon codes beyond the error-correction bound
• Some Applications of Coding Theory in Computational Complexity
• Algebraic testing and weight distributions of codes.

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)