Polynomial Codes Over Certain Finite Fields
From MaRDI portal
Publication:3280459
Cited in
(only showing first 100 items - show all)- KVaC: key-value commitments for blockchains and beyond
- Packed multiplication: how to amortize the cost of side-channel masking?
- An improved analysis of least squares superposition codes with Bernoulli dictionary
- An efficient and information theoretically secure rational secret sharing scheme based on symmetric bivariate polynomials
- Clique-based neural associative memories with local coding and precoding
- A new hybrid coding scheme: homomorphic minimum bandwidth repairing codes
- New Galois hulls of generalized Reed-Solomon codes
- A coded shared atomic memory algorithm for message passing architectures
- Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
- Better preprocessing for secure multiparty computation
- Technique for authenticating H.264/SVC and its performance evaluation over wireless mobile networks
- Keyword-Based Delegable Proofs of Storage
- Subcodes of Reed-Solomon Codes Suitable for Soft Decoding
- Optimal Las Vegas reduction from one-way set reconciliation to error correction
- A library for formalization of linear error-correcting codes
- Densities of codes of various linearity degrees in translation-invariant metric spaces
- Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings
- Simultaneous rational function reconstruction with errors: handling multiplicities and poles
- On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic
- Codes for Distributed Storage
- Gallager error-correcting codes for binary asymmetric channels
- The basics of bases
- A general family of MSRD codes and PMDS codes with smaller field sizes from extended Moore matrices
- Recovering erasures by using MDS codes over extension alphabets
- Noisy beeping networks
- Binding cryptographic keys into biometric data: optimization
- Fiat-Shamir security of FRI and related SNARKs
- Bounds in the Lee metric and optimal codes
- Large Hermitian hull GRS codes of any given length
- Comparison of error protection methods for audio-video broadcast over DVB-H
- Interpolation for Brill–Noether curves
- A characterization of MDS codes that have an error correcting pair
- MDS multi-twisted Reed-Solomon codes with small dimensional hull
- Linear system security -- detection and correction of adversarial sensor attacks in the noise-free case
- Fault-Tolerant Finite Field Computation in the Public Key Cryptosystems
- Testing equality under the local broadcast model
- Connections between the extreme points for Vandermonde determinants and minimizing risk measure in financial mathematics
- On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives
- Improved extension protocols for Byzantine broadcast and agreement
- Negacyclic codes of prime power length over the finite non-commutative chain ring \(\frac{\mathbb{F}_{p^m}[u,\theta]}{\langle u^2\rangle}\)
- Maximum distance separable codes based on circulant Cauchy matrices
- Duality of constacyclic codes of prime power length over the finite non-commutative chain ring \(\frac{ \mathbb{F}_{p^m} [ u , \theta ]}{ \langle u^2 \rangle} \)
- Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\)
- A new approach for computing the inverse of confluent Vandermonde matrices via Taylor's expansion
- Bilinear forms over a finite field, with applications to coding theory
- Efficient sampling of non-strict turnstile data streams
- Symmetric threshold multipath (STM): an online symmetric key management scheme
- Algebraic theory of block codes detecting independent errors
- The service rate region polytope
- Real-time optimized error protection assignment for scalable image and video over wireless channels
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
- Polynomial representation is tricky: maliciously secure private set intersection revisited
- Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices
- Inferring Sparse Preference Lists from Partial Information
- Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius
- Measure-resend authenticated semi-quantum key distribution with single photons
- Montgomery Residue Representation Fault-Tolerant Computation in GF(2 k )
- On algorithms to find \(p\)-ordering
- A New Algorithm for Decoding Reed-Solomon Codes
- Optimal quantum error correcting codes from absolutely maximally entangled states
- Network-agnostic security comes (almost) for free in DKG and MPC
- On multiple burst-correcting MDS codes
- A survey of cover-free families: constructions, applications, and generalizations
- Feynman graphs and the large dimensional limit of multipartite entanglement
- Simplified High-Speed High-Distance List Decoding for Alternant Codes
- Toy models of holographic duality between local Hamiltonians
- Optimal extension protocols for Byzantine broadcast and agreement
- Two-dimensional generalized discrete Fourier transform and related quasi-cyclic Reed-Solomon codes
- Self-stabilizing and private distributed shared atomic memory in seldomly fair message passing networks
- Zigzag decodable codes: linear-time erasure codes with applications to data storage
- Self-repairing codes
- scientific article; zbMATH DE number 7650135 (Why is no real title available?)
- Singleton-type bounds for list-decoding and list-recovery, and related results
- A subclass of \(q^m\)-ary Reed-Solomon codes and decoding of some rational GAG-codes
- Some new classes of additive MDS and almost MDS codes over finite fields
- A note on good permutation codes from Reed-Solomon codes
- A coding scheme that increases the code rate
- Fractal mathematical over extended finite fields Fp[x]/(f(x))
- MDS coding is better than replication for job completion times
- A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes
- Optimistic Erasure-Coded Distributed Storage
- Revisiting and extending the AONT-RS scheme: a robust computationally secure secret sharing scheme
- Computational integrity with a public random string from quasi-linear PCPs
- MDS array codes with efficient repair and small sub-packetization level
- Fast Reed-Solomon interactive oracle proofs of proximity
- Real-valued group testing for quantitative molecular assays
- Distributed CONGEST Algorithms against Mobile Adversaries
- A Decoding Approach to Reed–Solomon Codes from Their Definition
- Asymptotically optimal message dissemination with applications to blockchains
- Exact recording of Metropolis-Hastings-class Monte Carlo simulations using one bit per sample
- Adaptively secure inner product encryption from LWE
- Non-malleability against polynomial tampering
- The truncated and supplemented Pascal matrix and applications
- An application of information theory and error-correcting codes to fractional factorial experiments
- Codes in the sum-rank metric: fundamentals and applications
- Verified Erasure Correction in Coq with MathComp and VST
- String editing under pattern constraints
- STIR: Reed-Solomon proximity testing with fewer queries
- Simple algorithms for decoding systematic Reed-Solomon codes
- NP-hardness of Reed-Solomon decoding, and the Prouhet-Tarry-Escott problem
This page was built for publication: Polynomial Codes Over Certain Finite Fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3280459)
