Information set decoding for ring-linear codes
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1722678 (Why is no real title available?)
- scientific article; zbMATH DE number 3989251 (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?)
- scientific article; zbMATH DE number 3460471 (Why is no real title available?)
- scientific article; zbMATH DE number 1284126 (Why is no real title available?)
- scientific article; zbMATH DE number 1284420 (Why is no real title available?)
- scientific article; zbMATH DE number 1759341 (Why is no real title available?)
- scientific article; zbMATH DE number 910958 (Why is no real title available?)
- A new sieving-style information-set decoding algorithm
- An upper bound on the volume of discrete spheres
- Asymptotic behaviour of codes in rank metric over finite fields
- Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \)
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
- Asymptotics and improvements of sieving for codes
- Bilinear forms over a finite field, with applications to coding theory
- Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Decoding of linear codes over Galois rings
- Degree-D reverse multiplication-friendly embeddings: constructions and applications
- Density of free modules over finite chain rings
- Efficient decoding of Z/sub p/k-linear codes
- Error detecting and error correcting codes
- Error-correction performance of regular ring-linear LDPC codes over Lee channels
- FOLEAGE: \(\mathbb{F}_4\)OLE-based multi-party computation for Boolean circuits
- Folding Alternant and Goppa Codes With Non-Trivial Automorphism Groups
- FuLeakage: breaking FuLeeca by learning attacks
- Gilbert-Varshamov type bounds for linear codes over finite chain rings
- Hamming metric decoding of alternant codes over Galois rings
- Information set decoding for Lee-metric codes using restricted balls
- Information set decoding in the Lee metric with applications to cryptography
- Introduction to Coding Theory
- Limit distribution of the minimum distance of random linear codes
- Low-rank parity-check codes over Galois rings
- Lower bounds on lattice sieving and information set decoding
- Modular independence and generator matrices for codes over \(\mathbb{Z}_m\)
- New technique for decoding codes in the rank metric and its cryptography applications
- On the Complexity of the Rank Syndrome Decoding Problem
- On the Hamming distance of linear codes over a finite chain ring
- On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes
- On the decoding of Reed-Solomon and BCH codes over integer residue rings
- On the generalizations of the rank metric over finite chain rings
- On the hardness of the Lee syndrome decoding problem
- On the inherent intractability of certain coding problems (Corresp.)
- On the rank decoding problem over finite principal ideal rings
- On the structure of linear and cyclic codes over a finite chain ring
- Random codes: minimum distances and error exponents
- Rank-Metric Codes Over Finite Principal Ideal Rings and Applications
- Some new NP-complete coding problems
- The hardness of LPN over any integer ring and field for PCG applications
- Theory of codes with maximum rank distance
- Transform decoding of BCH codes overZm
- \textsf{FuLeeca}: a Lee-based signature scheme
This page was built for publication: Information set decoding for ring-linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6878991)
