scientific article; zbMATH DE number 1026591
From MaRDI portal
Publication:4343015
zbMath0871.00026MaRDI QIDQ4343015
No author found.
Publication date: 25 June 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to information and communication theory (94-06)
Related Items (15)
Fraud and data availability proofs: detecting invalid blocks in light clients ⋮ Negacyclic codes of prime power length over the finite non-commutative chain ring 𝔽pm[u,𝜃 〈u2〉] ⋮ Matrix structure and loss-resilient encoding/decoding ⋮ New constructions of self-dual codes via twisted generalized Reed-Solomon codes ⋮ Montgomery Residue Representation Fault-Tolerant Computation in GF(2 k ) ⋮ Combinatorial Neural Codes from a Mathematical Coding Theory Perspective ⋮ Fault-Tolerant Finite Field Computation in the Public Key Cryptosystems ⋮ A fast parallel Björck-Pereyra-type algorithm for solving Cauchy linear equations ⋮ Two-dimensional generalized discrete Fourier transform and related quasi-cyclic Reed--Solomon codes ⋮ New sets of optimal low-hit-zone frequency-hopping sequences based on \(m\)-sequences ⋮ Polynomial evaluation over finite fields: new algorithms and complexity bounds ⋮ Pre-synthesis Optimization for Asynchronous Circuits Using Compiler Techniques ⋮ Interactive Communication, Diagnosis and Error Control in Networks ⋮ Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\) ⋮ Matrix characterization of linear codes with arbitrary Hamming weight hierarchy
This page was built for publication:
