Polynomial Codes Over Certain Finite Fields

Cited In (only showing first 100 items - show all)

A library for formalization of linear error-correcting codes
Gallager error-correcting codes for binary asymmetric channels
A general family of MSRD codes and PMDS codes with smaller field sizes from extended Moore matrices
Simultaneous rational function reconstruction with errors: handling multiplicities and poles
Noisy beeping networks
Recovering erasures by using MDS codes over extension alphabets
Binding cryptographic keys into biometric data: optimization
Bounds in the Lee metric and optimal codes
Interpolation for Brill–Noether curves
Comparison of error protection methods for audio-video broadcast over DVB-H
A characterization of MDS codes that have an error correcting pair
Fault-Tolerant Finite Field Computation in the Public Key Cryptosystems
Linear system security -- detection and correction of adversarial sensor attacks in the noise-free case
Testing equality under the local broadcast model
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} \)
A new approach for computing the inverse of confluent Vandermonde matrices via Taylor's expansion
Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\)
Bilinear forms over a finite field, with applications to coding theory
Symmetric threshold multipath (STM): an online symmetric key management scheme
Algebraic theory of block codes detecting independent errors
Real-time optimized error protection assignment for scalable image and video over wireless channels
Interactive communication with unknown noise rate
Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices
Polynomial representation is tricky: maliciously secure private set intersection revisited
Measure-resend authenticated semi-quantum key distribution with single photons
A New Algorithm for Decoding Reed-Solomon Codes
On algorithms to find \(p\)-ordering
Optimal quantum error correcting codes from absolutely maximally entangled states
Feynman graphs and the large dimensional limit of multipartite entanglement
Toy models of holographic duality between local Hamiltonians
On multiple burst-correcting MDS codes
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
A note on good permutation codes from Reed-Solomon codes
A coding scheme that increases the code rate
A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes
Optimistic Erasure-Coded Distributed Storage
Computational integrity with a public random string from quasi-linear PCPs
Fast Reed-Solomon interactive oracle proofs of proximity
Real-valued group testing for quantitative molecular assays
A Decoding Approach to Reed–Solomon Codes from Their Definition
Exact recording of Metropolis-Hastings-class Monte Carlo simulations using one bit per sample
Non-malleability against polynomial tampering
The truncated and supplemented Pascal matrix and applications
NP-hardness of Reed-Solomon decoding, and the Prouhet-Tarry-Escott problem
Simple algorithms for decoding systematic Reed-Solomon codes
Graph reconstruction in the congested clique
A new minimize matrix computation coding method for distributed storage systems
Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head
E-commerce of digital items and the problem of item validation: introducing the concept of reversible degradation
Clique-based neural associative memories with local coding and precoding
An efficient and information theoretically secure rational secret sharing scheme based on symmetric bivariate polynomials
An improved analysis of least squares superposition codes with Bernoulli dictionary
A new hybrid coding scheme: homomorphic minimum bandwidth repairing codes
New Galois hulls of generalized Reed-Solomon codes
Better preprocessing for secure multiparty computation
Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
A coded shared atomic memory algorithm for message passing architectures
Keyword-Based Delegable Proofs of Storage
Technique for authenticating H.264/SVC and its performance evaluation over wireless mobile networks
Codes for Distributed Storage
On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic
The basics of bases
Fiat-Shamir security of FRI and related SNARKs
Large Hermitian hull GRS codes of any given length
MDS multi-twisted Reed-Solomon codes with small dimensional hull
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
Efficient sampling of non-strict turnstile data streams
The service rate region polytope
Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
Inferring Sparse Preference Lists from Partial Information
Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius
Montgomery Residue Representation Fault-Tolerant Computation in GF(2 k )
Network-agnostic security comes (almost) for free in DKG and MPC
A survey of cover-free families: constructions, applications, and generalizations
Simplified High-Speed High-Distance List Decoding for Alternant Codes
Optimal extension protocols for Byzantine broadcast and agreement
Title not available (Why is that?)
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
Fractal mathematical over extended finite fields Fp[x]/(f(x))
MDS coding is better than replication for job completion times
Revisiting and extending the AONT-RS scheme: a robust computationally secure secret sharing scheme
MDS array codes with efficient repair and small sub-packetization level
Distributed CONGEST Algorithms against Mobile Adversaries
Asymptotically optimal message dissemination with applications to blockchains
An application of information theory and error-correcting codes to fractional factorial experiments
Adaptively secure inner product encryption from LWE
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
Secure multi-party computation in large networks

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)