scientific article; zbMATH DE number 3397423

W. Wesley Peterson, Edward J. Jun. Weldon

Publication date: 1972

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Information theory (general) (94A15) Theory of error-correcting codes and error-detecting codes (94B99) Communication theory (94A05)

Related Items (only showing first 100 items - show all)

On an infinite class of Steiner systems with \(t=3\) and \(k=6\) ⋮ Interaction balance for symmetrical factorial designs with generalized minimum aberration ⋮ Algebraic testing and weight distributions of codes. ⋮ Long module skew codes are good ⋮ A complete decoding algorithm for double-error-correcting primitive binary BCH codes of odd \(m\) ⋮ A lower bound for polynomial multiplication ⋮ Feedback vertex set in hypercubes ⋮ Quasicyclic symmetry and the directed divergence in information theory ⋮ A mathematical framework for algorithm-based fault-tolerant computing over a ring of integers ⋮ Coding techniques for handling failures in large disk arrays ⋮ Theory of minimum aberration blocked regular mixed factorial designs ⋮ Linear codes with balanced weight distribution ⋮ Estimates for distribution of the minimal distance of a random linear code ⋮ Generalized Reed-Muller codes over \({\mathbb{Z}_q}\) ⋮ An efficient method for identifying clear effects in blocked fractional factorial designs ⋮ 2-dimensional arithmetic residue check codes ⋮ A note on the computation of the bit error rate for binary block codes ⋮ Lower bounds for codes correcting moderate-density bursts of fixed length with Lee weight consideration ⋮ Bursts in \(m\)-metric array codes ⋮ Generating a PRSA with triangular symmetry ⋮ Geometric spaces and efficient codes ⋮ On the recovery of error patterns from signatures obtained in digital system testing ⋮ Linear codes interpolation from noisy patterns by means of a vector quantization process ⋮ Feedback shift registers, 2-adic span, and combiners with memory ⋮ Minimum secondary aberration fractional factorial split-plot designs in terms of consulting designs ⋮ A new concatenated BCH-matrix type-B code ⋮ Campopiano-type bounds in non-Hamming array coding ⋮ A t-unidirectional error-detecting systematic code ⋮ A bound for codes correcting random and low-density closed-loop burst errors ⋮ Bounds on the minimum code distance for nonbinary codes based on bipartite graphs ⋮ Controlled random tests ⋮ On the number of facets of polytopes representing comparative probability orders ⋮ Polynomial division using left shift register ⋮ Coordinating team players within a noisy iterated prisoner's dilemma tournament ⋮ Algebraic theory of block codes detecting independent errors ⋮ The weight distribution of linear codes over \(GF(q^l)\) having generator matrix over \(GF(q)\) ⋮ Quadratic residue codes and symplectic groups ⋮ Blockwise Lee error-correcting codes ⋮ Sets of even type in PG(3,4), alias the binary (85,24) projective geometry code ⋮ Necessary and sufficient number of parity checks in codes correcting random errors and bursts with weight constraints under a new metric ⋮ A bound for random and closed loop burst error detecting codes ⋮ A note on Reed-Muller codes ⋮ A necessary and sufficient condition for fundamental periods of cascade machines to be products of the fundamental periods of their constituent finite state machines ⋮ An upper bound for codes detecting low-density closed-loop bursts ⋮ Completely regular codes and completely transitive codes ⋮ An elementary derivation of the annihilator polynomial for extremal \((2s+1)\)-designs ⋮ Cyclic symmetry and the Shannon entropy ⋮ Some properties of self-reciprocal polynomials ⋮ On the Gröbner bases of some symmetric systems and their application to coding theory. ⋮ A generalization of the BCH bound for cyclic codes, including the Hartmann-Tzeng bound ⋮ The covering radii of a class of binary cyclic codes and some BCH codes ⋮ On the parameters of codes for the Lee and modular distance ⋮ Fibonacci matrices, a generalization of the ``Cassini formula, and a new coding theory ⋮ Complete tests relative to displacing faults of inputs of circuits ⋮ Quasi-cyclic Goppa codes with special Goppa polynomials and matched location sets ⋮ On cyclic codes which are \(q\)-ary images of linear codes ⋮ Synchronization ⋮ Remark on a result of Constantine ⋮ Integer codes correcting single errors and burst asymmetric errors within a byte ⋮ Invertibility of discrete-event dynamic systems ⋮ Application of coding theory to interconnection networks ⋮ The dimension of projective geometry codes ⋮ On decoding by error location and dependent sets of error positions ⋮ Fire codes revisited ⋮ Maximal partial spreads and the modular \(n\)-queen problem ⋮ On \(Q\)-ary images of self-dual codes ⋮ Correcting errors and erasures via the syndrome variety ⋮ Constructions of new families of nonbinary CSS codes ⋮ Codes projectifs à deux ou trois poids associes aux hyperquadriques d'une géométrie finie ⋮ Research on the unbiased probability estimation of error-correcting output coding ⋮ Gröbner bases and combinatorics for binary codes ⋮ A restriction on the weight enumerator of a self-dual code ⋮ Lower bounds over codes correcting bursts with a given Lee weight or intensity ⋮ Equidistant cyclic codes over GF(q) ⋮ Codes correcteurs d'erreurs autoorthogonaux sur le corps à deux éléments et formes quadratiques entières definies positives à discriminant +1 ⋮ Codes projectifs à deux poids, caps complets et ensembles de différences ⋮ Theory and design of a digital stochastic computer random number generator ⋮ Bounded distance decoding of linear error-correcting codes with Gröbner bases ⋮ A construction of some \([n,k,d;q\)-codes meeting the Griesmer bound] ⋮ Cryptology: The mathematics of secure communication ⋮ A linear-algebra problem from algebraic coding theory ⋮ The pseudorandom sequence of arrays ⋮ Divisibility of codes meeting the Griesmer bound ⋮ On class weights of CT bursts ⋮ A commutative algebra approach to linear codes ⋮ Optimal characteristic polynomials for digital multistep pseudorandom numbers ⋮ A class of generalized cyclic codes ⋮ Computer algebra tales on Goppa codes and McEliece cryptography ⋮ Theory of optimal blocking of \(2^{n-m}\) designs ⋮ Construction and decoding of BCH codes over finite commutative rings ⋮ Construction of optimal linear codes using flats and spreads in a finite projective geometry ⋮ An algebra of discrete channels that involve combinations of three basic error types ⋮ An improved algorithm for Davida amd Cowles's decoding method ⋮ Analysis of a PRSA generator ⋮ On the covering radius of cyclic linear codes and arithmetic codes ⋮ Fault-tolerant computation in groups and semigroups: Applications to automata, dynamic systems and Petri nets ⋮ On designs and formally self-dual codes ⋮ Provably good pattern generators for a random pattern test ⋮ Characterization of minimum aberration mixed factorials in terms of consulting designs ⋮ Gröbner basis solutions of constrained interpolation problems

This page was built for publication: