Publication:5665102
From MaRDI portal
zbMath0251.94007MaRDI QIDQ5665102
W. Wesley Peterson, Edward J. Jun. Weldon
Publication date: 1972
94-02: Research exposition (monographs, survey articles) pertaining to information and communication theory
94A15: Information theory (general)
94B99: Theory of error-correcting codes and error-detecting codes
94A05: Communication theory
Related Items
Partition Algorithm For Parallel Processing Of Array Multiplication In Gf(2m) Fields, High-density CT burst error-locating linear codes, Computing the reciprocal of units in Galois rings, REVIEW OF CHAOS COMMUNICATION BY FEEDBACK CONTROL OF SYMBOLIC DYNAMICS, QUANTUM CODES CONSTRUCTED FROM BINARY CYCLIC CODES, Low-Density Burst Error Locating/Correcting Linear Codes, NOTES ON THE FIDELITY OF SYMPLECTIC QUANTUM ERROR-CORRECTING CODES, High-density-burst error detection, Fast algorithms for decoding the (23, 12) binary Golay code with four-error-correcting capability, Sufficient Condition over the Number of Parity Checks for Burst Error Detection/Correction in Linear Lee Weight Codes, Correctable Errors of Weight Half the Minimum Distance Plus One for the First-Order Reed-Muller Codes, Bound for solid burst error correction with Lee weight, T-shift synchronization codes, T-shift synchronization codes, On the classification and enumeration of self-dual codes, Algebraic structure of quasicyclic codes, Difference equations and Rao-Hamming bound, Some Methods of Detecting Sequential Errors in Computer Operation, Burst Error Locating Linear Codes, Obtaining Specified Irreducible Polynomials over Finite Fields, On Construction of Matrices with Distinct Submatrices, The generation of rimitive olynomials in GF(q) with independent roots and their applications for ower residue codes, VLSI testing and finite field multipliers using normal basis, Arithmetic in a Finite Field, Design of experiments to detect nonnegligible variables in a linear model, Unnamed Item, Weak radix representation and cyclic codes over euclidean domains, Primitive Polynomials Over Finite Fields, Correcting errors and erasures via the syndrome variety, Lower bounds over codes correcting bursts with a given Lee weight or intensity, Maximal partial spreads and the modular \(n\)-queen problem, On class weights of CT bursts, Characterization of minimum aberration mixed factorials in terms of consulting designs, Interaction balance for symmetrical factorial designs with generalized minimum aberration, An efficient method for identifying clear effects in blocked fractional factorial designs, Lower bounds for codes correcting moderate-density bursts of fixed length with Lee weight consideration, Bursts in \(m\)-metric array codes, Minimum secondary aberration fractional factorial split-plot designs in terms of consulting designs, Campopiano-type bounds in non-Hamming array coding, Coordinating team players within a noisy iterated prisoner's dilemma tournament, Completely regular codes and completely transitive codes, An elementary derivation of the annihilator polynomial for extremal \((2s+1)\)-designs, Some properties of self-reciprocal polynomials, Fibonacci matrices, a generalization of the ``Cassini formula, and a new coding theory, Synchronization, Construction of optimal linear codes using flats and spreads in a finite projective geometry, On the covering radius of cyclic linear codes and arithmetic codes, On an infinite class of Steiner systems with \(t=3\) and \(k=6\), A lower bound for polynomial multiplication, Quasicyclic symmetry and the directed divergence in information theory, 2-dimensional arithmetic residue check codes, A note on the computation of the bit error rate for binary block codes, On the recovery of error patterns from signatures obtained in digital system testing, A new concatenated BCH-matrix type-B code, A t-unidirectional error-detecting systematic code, Polynomial division using left shift register, Algebraic theory of block codes detecting independent errors, The weight distribution of linear codes over \(GF(q^l)\) having generator matrix over \(GF(q)\), 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, Cyclic symmetry and the Shannon entropy, A generalization of the BCH bound for cyclic codes, including the Hartmann-Tzeng bound, On the parameters of codes for the Lee and modular distance, On cyclic codes which are \(q\)-ary images of linear codes, 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, On \(Q\)-ary images of self-dual codes, Codes projectifs à deux ou trois poids associes aux hyperquadriques d'une géométrie finie, A restriction on the weight enumerator of a self-dual code, 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, Cryptology: The mathematics of secure communication, A linear-algebra problem from algebraic coding theory, Divisibility of codes meeting the Griesmer bound, Construction and decoding of BCH codes over finite commutative rings, An improved algorithm for Davida amd Cowles's decoding method, Analysis of a PRSA generator, On designs and formally self-dual codes, Provably good pattern generators for a random pattern test, A complete decoding algorithm for double-error-correcting primitive binary BCH codes of odd \(m\), A mathematical framework for algorithm-based fault-tolerant computing over a ring of integers, Feedback shift registers, 2-adic span, and combiners with memory, Quadratic residue codes and symplectic groups, On the Gröbner bases of some symmetric systems and their application to coding theory., A class of generalized cyclic codes, Theory of optimal blocking of \(2^{n-m}\) designs, Gröbner basis solutions of constrained interpolation problems, A construction of some \([n,k,d;q\)-codes meeting the Griesmer bound], The pseudorandom sequence of arrays, Optimal characteristic polynomials for digital multistep pseudorandom numbers, An algebra of discrete channels that involve combinations of three basic error types, Fault-tolerant computation in groups and semigroups: Applications to automata, dynamic systems and Petri nets, Algebraic testing and weight distributions of codes., Theory of minimum aberration blocked regular mixed factorial designs, Linear codes with balanced weight distribution, Generating a PRSA with triangular symmetry, Geometric spaces and efficient codes, Linear codes interpolation from noisy patterns by means of a vector quantization process, A bound for codes correcting random and low-density closed-loop burst errors, Weight functions and generalized Hamming weights of linear codes, Cyclically permutable representations of cyclic codes, CT bursts-from classical to array coding, On some perfect codes with respect to Lee metric, Applications of the grassmann algebra to coding theory, Unnamed Item, Further remarks for the matrix type-B codes, Multilevel Pseudocyclic Codes, Semi-systolic Modular Multiplier over GF(2m), ON THE GENERALIZED-LEE-RT-PSEUDO-METRIC (THE GLRTP-METRIC) ARRAY CODES CORRECTING BURST ERRORS, REPEATED BURST ERROR CORRECTING LINEAR CODES, Unnamed Item, Unnamed Item, A Method to Compute Minimal Polynomials, Unnamed Item, Orthogonal transformation of logic functions, Synthesis of multifunction and universal logic elements over residue class rings. I, Indecomposable local maps of tessellation automata, Realization of systems of boolean functions by cascaded configurations of identical tunable elements
