Polynomial Codes Over Certain Finite Fields

DOI10.1137/0108018zbMath0099.34403OpenAlexW2148575324WikidataQ56081991 ScholiaQ56081991MaRDI QIDQ3280459

Gustave Solomon, Irving S. Reed

Publication date: 1960

Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0108018

zbMATH Keywords

probability theory etc.

Related Items

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 characterization of MDS codes that have an error correcting pair, On algorithms to find \(p\)-ordering, Comparison of error protection methods for audio-video broadcast over DVB-H, A New Algorithm for Decoding Reed-Solomon Codes, AN EFFICIENT AND INFORMATION THEORETICALLY SECURE RATIONAL SECRET SHARING SCHEME BASED ON SYMMETRIC BIVARIATE POLYNOMIALS, Private Stream Search at Almost the Same Communication Cost as a Regular Search, Interactive communication with unknown noise rate, Polynomial representation is tricky: maliciously secure private set intersection revisited, Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\), Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring, Negacyclic codes of prime power length over the finite non-commutative chain ring 𝔽pm[u,𝜃 〈u2〉], Simple algorithms for decoding systematic Reed-Solomon codes, Optimal extension protocols for Byzantine broadcast and agreement, Secure multi-party computation in large networks, New Galois hulls of generalized Reed-Solomon codes, Zigzag decodable codes: linear-time erasure codes with applications to data storage, Real-valued group testing for quantitative molecular assays, MDS coding is better than replication for job completion times, E-commerce of digital items and the problem of item validation: introducing the concept of reversible degradation, A Decoding Approach to Reed–Solomon Codes from Their Definition, NP-Hardness of Reed--Solomon Decoding, and the Prouhet--Tarry--Escott Problem, Algebraic theory of block codes detecting independent errors, Technique for authenticating H.264/SVC and its performance evaluation over wireless mobile networks, A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices, The truncated and supplemented Pascal matrix and applications, Graph reconstruction in the congested clique, On multiple burst-correcting MDS codes, Measure-resend authenticated semi-quantum key distribution with single photons, Interpolation for Brill–Noether curves, Keyword-Based Delegable Proofs of Storage, 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, Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head, Connections between the extreme points for Vandermonde determinants and minimizing risk measure in financial mathematics, Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius, Montgomery Residue Representation Fault-Tolerant Computation in GF(2 k ), Exact recording of Metropolis-Hastings-class Monte Carlo simulations using one bit per sample, On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives, Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022, Unnamed Item, Bounds in the Lee metric and optimal codes, Network-agnostic security comes (almost) for free in DKG and MPC, 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, Distributed CONGEST Algorithms against Mobile Adversaries, A new hybrid coding scheme: homomorphic minimum bandwidth repairing codes, Adaptively secure inner product encryption from LWE, KVaC: key-value commitments for blockchains and beyond, The basics of bases, Packed multiplication: how to amortize the cost of side-channel masking?, Optimal quantum error correcting codes from absolutely maximally entangled states, Self-stabilizing and private distributed shared atomic memory in seldomly fair message passing networks, A library for formalization of linear error-correcting codes, Clique-Based Neural Associative Memories with Local Coding and Precoding, A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes, Optimistic Erasure-Coded Distributed Storage, Fault-Tolerant Finite Field Computation in the Public Key Cryptosystems, Subcodes of Reed-Solomon Codes Suitable for Soft Decoding, Inferring Sparse Preference Lists from Partial Information, Two-dimensional generalized discrete Fourier transform and related quasi-cyclic Reed--Solomon codes, Fast Reed-Solomon Interactive Oracle Proofs of Proximity, Linear system security -- detection and correction of adversarial sensor attacks in the noise-free case, A coded shared atomic memory algorithm for message passing architectures, Binding cryptographic keys into biometric data: optimization, An application of information theory and error-correcting codes to fractional factorial experiments, Toy models of holographic duality between local Hamiltonians, Symmetric threshold multipath (STM): an online symmetric key management scheme, Optimal Las Vegas reduction from one-way set reconciliation to error correction, A coding scheme that increases the code rate, Real-time optimized error protection assignment for scalable image and video over wireless channels, Bilinear forms over a finite field, with applications to coding theory, A new minimize matrix computation coding method for distributed storage systems, An improved analysis of least squares superposition codes with Bernoulli dictionary, Revisiting and Extending the AONT-RS Scheme: A Robust Computationally Secure Secret Sharing Scheme, Better Preprocessing for Secure Multiparty Computation, On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic, Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices, Simplified High-Speed High-Distance List Decoding for Alternant Codes, Gallager error-correcting codes for binary asymmetric channels, A note on good permutation codes from Reed-Solomon codes, Self-repairing codes, Simultaneous rational function reconstruction with errors: handling multiplicities and poles, Feynman graphs and the large dimensional limit of multipartite entanglement, Non-malleability against polynomial tampering, Codes for Distributed Storage, Codes in the Sum-Rank Metric: Fundamentals and Applications, Noisy beeping networks, Maximum Distance Separable Codes Based on Circulant Cauchy Matrices, Efficient sampling of non-strict turnstile data streams, A new approach for computing the inverse of confluent Vandermonde matrices via Taylor's expansion, Computational Integrity with a Public Random String from Quasi-Linear PCPs, Fractal mathematical over extended finite fields Fp[x/(f(x))], Recovering erasures by using MDS codes over extension alphabets, Testing equality under the local broadcast model