scientific article
From MaRDI portal
Publication:4044441
zbMath0292.94011MaRDI QIDQ4044441
Publication date: 1970
Full work available at URL: http://mathnet.ru/eng/ppi/v6/i3/p24
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
cyclicdecoding schemebinary error-correcting codesBose-Chaudhuri-Hoquingham (BCH) codeGoppa codes of short lengthsnoncyclic
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cyclic codes (94B15) Decoding (94B35)
Related Items (47)
Constructions of asymmetric quantum alternant codes ⋮ Quasi-perfect linear codes from planar and APN functions ⋮ Equations for point configurations to Lie on a rational normal curve ⋮ A Summary of McEliece-Type Cryptosystems and their Security ⋮ Cyclic Generalized Separable (L, G) Codes ⋮ Non-binary irreducible quasi-cyclic parity-check subcodes of Goppa codes and extended Goppa codes ⋮ Which extended Goppa codes are cyclic? ⋮ E-commerce of digital items and the problem of item validation: introducing the concept of reversible degradation ⋮ Decoding algorithms for Goppa codes with errors and erasures ⋮ ON DECODING ALGORITHMS FOR GENERALIZED REED — SOLOMON CODES WITH ERRORS AND ERASURES. II ⋮ Algebraic theory of block codes detecting independent errors ⋮ Binary generalized \((L,G)\) codes that are perfect in a weighted Hamming metric ⋮ The dual geometry of Hermitian two-point codes ⋮ Class of generalized Goppa codes perfect in weighted Hamming metric ⋮ Two classes of cyclic extended double-error-correcting Goppa codes ⋮ Upper bound on the number of inequivalent extended binary irreducible Goppa codes ⋮ Two classes of quasi-cyclic codes via irreducible polynomials ⋮ Improving the minimum distance bound of trace Goppa codes ⋮ Leakage-resilient linear secret-sharing against arbitrary bounded-size leakage family ⋮ A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors ⋮ Chosen-ciphertext secure code-based threshold public key encryptions with short ciphertext ⋮ Decoding McEliece with a hint -- secret Goppa key parts reveal everything ⋮ More constructions of lossy and correlation-secure trapdoor functions ⋮ New binary codes from extended Goppa codes ⋮ Galois hulls of special Goppa codes and related codes with application to EAQECCs ⋮ Asymptotically good convolutional codes ⋮ Quantum-assisted QD-CFS signatures ⋮ Totally decomposed cumulative Goppa codes with improved estimations ⋮ Quasi-cyclic Goppa codes with special Goppa polynomials and matched location sets ⋮ Lower bound of the covering radius of irreducible Goppa codes ⋮ On decoding algorithms for Goppa codes ⋮ Permutation groups, minimal degrees and quantum computing. ⋮ Lower bound of covering radius of binary irreducible Goppa codes ⋮ An improved Bombieri-Weil bound and applications to coding theory ⋮ New bounds on the distance distribution of extended Goppa codes ⋮ A new subclass of cyclic Goppa codes ⋮ New identities relating wild Goppa codes ⋮ Special classes of separable Goppa codes with improved parameter estimates ⋮ Implementation of McEliece Based on Quasi-dyadic Goppa Codes for Embedded Devices ⋮ Simplified High-Speed High-Distance List Decoding for Alternant Codes ⋮ Wild McEliece Incognito ⋮ A survey of constructive coding theory, and a table of binary codes of highest known rate ⋮ On quaternary Goppa codes ⋮ Unnamed Item ⋮ Goppa codes over the \(p\)-adic integers and integers modulo \(p^e\) ⋮ The projective geometry of the Gale transform. ⋮ Further results about the cyclicity of generalized Goppa codes
This page was built for publication: