scientific article
From MaRDI portal
Publication:3688305
zbMath0569.94012MaRDI QIDQ3688305
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Linear codes (general theory) (94B05) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Cyclic codes (94B15) Decoding (94B35) Convolutional codes (94B10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)
Related Items (50)
Transform domain characterization of cyclic codes over \(\mathbb{Z}_ m\) ⋮ Weight distributions of geometric Goppa codes ⋮ A parallel Viterbi decoding algorithm ⋮ Polynomials generating Hamming codes ⋮ A Comprehensive Definition of Fire Codes ⋮ A mathematical framework for algorithm-based fault-tolerant computing over a ring of integers ⋮ Combinatorial \(S_ n\)-modules as codes ⋮ Unnamed Item ⋮ One-step completely orthogonalizable codes from generalized quadrangles ⋮ Recovering highly-complex linear recurrences of integer sequences ⋮ Simple algorithms for decoding systematic Reed-Solomon codes ⋮ Unnamed Item ⋮ Decoding algorithms for Goppa codes with errors and erasures ⋮ Secure consensus with distributed detection via two-hop communication ⋮ Fast algorithms for decoding the (23, 12) binary Golay code with four-error-correcting capability ⋮ Generic error control coding modules ⋮ High-speed \(\mathrm{RS}(255, 239)\) decoder based on LCC decoding ⋮ On the weight distribution of the cosets of MDS codes ⋮ Recovery of sparse integer vectors from linear measurements ⋮ A family of constacyclic ternary quasi-perfect codes with covering radius 3 ⋮ Linear-code multicast on parallel architectures ⋮ Finite field trigonometric transforms ⋮ Fast skew-feedback shift-register synthesis ⋮ A construction of maximal linearly independent array ⋮ Efficient detection of discrepancies in multiple file copies ⋮ Strengthening the Gilbert-Varshamov bound ⋮ The Algebra of the Finite Fourier Transform and Coding Theory ⋮ Attacks Against Filter Generators Exploiting Monomial Mappings ⋮ On decoding algorithms for Goppa codes ⋮ Parameter choices on Guruswami-Sudan algorithm for polynomial reconstruction ⋮ Quadratic residue codes in their prime ⋮ Berlekamp-Massey algorithm, continued fractions, Padé approximations, and orthogonal polynomials ⋮ An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings ⋮ Hermitian codes as generalized Reed-Solomon codes ⋮ On a complete decoding scheme for binary radical codes ⋮ The generalized Goertzel algorithm and its parallel hardware implementation ⋮ Polynomial evaluation over finite fields: new algorithms and complexity bounds ⋮ Wavelengths distribution of chaotic travelling waves in some cellular automata. ⋮ On the structure of linear recurrent error-control codes ⋮ Error resilient data transport in sensor network applications: A generic perspective ⋮ On cyclic self-dual codes ⋮ Method for recognition of parameters of error-correcting block-cyclic codes by a generator polynomial ⋮ A family of ternary quasi-perfect BCH codes ⋮ Cryptanalysis of the GPRS encryption algorithms GEA-1 and GEA-2 ⋮ Representation of multichannel signature analyzers by linear polynomials over finite fields ⋮ On k-error linear complexity of some explicit nonlinear pseudorandom sequences ⋮ Mathematical models of modified crypto-code means of information protection based on coding theory schemes ⋮ Coding theory on h(x) extension of m sequences for Fibonacci numbers ⋮ Two new decoding algorithms for Reed-Solomon codes ⋮ Displacement structure for Hankel, Vandermonde, and related (derived) matrices
This page was built for publication:
