scientific article

Publication date: 1961

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

polynomial rings cyclic codes Galois fields decoding methods Bose-Chaudhuri codes codes for checking arithmetic operations cyclic codes for burst-error correction error-correcting capabilities of linear codes linear switching circuits recurrent codes

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Theory of error-correcting codes and error-detecting codes (94Bxx)

Related Items

The completion of optimal cyclic quaternary codes of weight 3 and distance 3, A Comprehensive Definition of Fire Codes, Comparison of four numerical algorithms for solving the Liapunov matrix equation†, Sphere-packing in the Hamming metric, Test signals choice for determining the temporal characteristics of objects under normal operating conditions, Interrelation of the cyclic and weight structure of codes over \(\text{GF}(q)\) and proportionality classes, Random Numbers Generated by Linear Recurrence Modulo Two, Codici binari a peso costante, Computer cryptographic techniques for processing and storage of confidential information†, Some properties of cyclic codes†, Maximum length codes and their relation with the incomplete block design, A note on constant weight cyclic codes, Minimum redundancy multiple burst-error-correcting cyclic codes†, On the errors that learning machines will make, Algebraic theory of block codes detecting independent errors, Three-dimensional cyclic Fire codes, Correlation methods, Two-dimensional array codes correcting rectangular burst errors, Non-parametric methods of system identification, q-Markov Cover identification using pseudo-random binary signals, An error correcting code and its implementation†, Mathematical aspects of outer-product asynchronous content-addressable memories, Application of coding theory to the construction of the Singer difference sets†, Une famille infinie de formes quadratiques entières; leurs groupes d'automorphismes, Unnamed Item, Unnamed Item, On the computation of coset leaders with high Hamming weight., Additive complexity in directed computations, Partitioning circuits for improved testability, Unnamed Item, New uniqueness proofs for the (5,8,24), (5,6,12) and related Steiner systems, Test signals choice for system characteristics identification: taking into account the output deviation range constraint, Relative one-weight linear codes, Exhaustive testing of almost all devices with outputs depending on limited number of inputs, Super-visible codes, On weights in quadratic-residue codes, Information theory and the complexity of boolean functions, On two level symmetrical factorial designs, On error-tolerant DNA screening, Realizing Boolean functions on disjoint sets of variables, Binary and ternary signals with small cross correlations, A characterization of some \([n,k,d;q\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry], Systematic construction of optimal linear recurrent codes for burst error correction, Perfect codes and the Mathieu groups, Some properties of binary n-tuples with reference to cyclic codes, A vector-space packing problem, Sull'invarianza dei codici lineari rispetto a certe trasformazioni, On the nonexistence of close-packed double Hamming-error-correcting codes on \(q = 7\) symbols, Optimal binary codes derived from \(\mathbb{F}_2 \mathbb{F}_4\)-additive cyclic codes, On the Golay perfect binary code, Alcuni aspetti della struttura formale dei codici lineari, Linear modelling of multivariable systems with pseudo-random binary input signals, A statistical method for investigating the perceptual confusions among geometric configurations, Incomplete block design codes for ultra high speed computer applications, Good self dual codes exist, Nearly perfect binary codes, Iterative decoding of linear codes by a modulo-2 linear program, Consecutive zeros in convolutional codewords, When lagged Fibonacci generators jump, A classification of self-orthogonal codes over GF(2), On a new class of binary group codes, On a Burst-Error Correcting Code, Searching for an optimal path in a tree with random costs, Concatenation Properties or δ-Sequences Over GF(2), Lower bounds in algebraic computational complexity, [https://portal.mardi4nfdi.de/wiki/Publication:5515921 Verschl�sselungstheorie f�r symmetrische Kan�le], Space-bounded hierarchies and probabilistic computations, Bounded-depth, polynomial-size circuits for symmetric functions, Analytical Characteristics of the DES, Complexity analysis of binary nonlinear feedforward sequences through minimum polynomials of compound matrices