scientific article; zbMATH DE number 3318360
From MaRDI portal
Publication:5598073
zbMath0199.54101MaRDI QIDQ5598073
Publication date: 1969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
Repeated-root constacyclic codes of length \(n l p^s\) ⋮ A complete decoding algorithm for double-error-correcting primitive binary BCH codes of odd \(m\) ⋮ An improvement of the Griesmer bound for some small minimum distances ⋮ Independent domination in hypercubes ⋮ A new algebraic algorithm to decode the ternary Golay code ⋮ A database of linear codes over \(\mathbb F_{13}\) with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm ⋮ Recent progress on weight distributions of cyclic codes over finite fields ⋮ Upper bounds for constant weight and Lee codes slightly outside the Plotkin range ⋮ Lower bounds for codes correcting moderate-density bursts of fixed length with Lee weight consideration ⋮ Parallel computation of polynomial GCD and some related parallel computations over abstract fields ⋮ On structure and distances of some classes of repeated-root constacyclic codes over Galois rings ⋮ Bent functions and random Boolean formulas ⋮ The complexity of a periodic sequence over GF(p) ⋮ The combinatorics of discrete self-similarity ⋮ A \(q\)-polynomial approach to constacyclic codes ⋮ Programmable cellular automata based Montgomery hardware architecture ⋮ Monomial codes seen as invariant subspaces ⋮ On domination numbers of Cartesian products of paths ⋮ Distribution of the extreme values of the number of ones in Boolean analogues of the Pascal triangle ⋮ A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes ⋮ Univariate polynomial factorization over finite fields ⋮ Error linear complexity measures for multisequences ⋮ Polynomial division using left shift register ⋮ The weight distribution of linear codes over \(GF(q^l)\) having generator matrix over \(GF(q)\) ⋮ An algorithm for constructing a minimal partial realization in the multivariable case ⋮ The set of reversible \(90/150\) cellular automata is regular ⋮ Quadratic residue codes and symplectic groups ⋮ On the MacWilliams identity ⋮ Necessary and sufficient number of parity checks in codes correcting random errors and bursts with weight constraints under a new metric ⋮ Periodic sequences with maximal \(N\)-adic complexity and large \(k\)-error \(N\)-adic complexity over \(Z/(N)\) ⋮ Fixed-point tile sets and their applications ⋮ New minimum distance bounds for linear codes over GF(5). ⋮ On primitive elements of trace equal to 1 in GF(\(2^ m)\) ⋮ Computing lower bounds on tensor rank over finite fields ⋮ A new upper bound on nonbinary block codes ⋮ Some properties of self-reciprocal polynomials ⋮ Primitive elements and polynomials with arbitrary trace ⋮ A generalization of the BCH bound for cyclic codes, including the Hartmann-Tzeng bound ⋮ The BCH-Goppa decoding as a moment problem and a tau function over finite fields. ⋮ On the parameters of codes for the Lee and modular distance ⋮ A functional version of Hilbert's theorem 90 ⋮ A semi-systolic decoder for the PDSC-73 error-correcting code ⋮ Two-dimensional shift register synthesis and Gröbner bases for polynomial ideals over an integer residue ring ⋮ Probability models on rankings ⋮ A general representation theory for constructing groups of permutation polynomials ⋮ Threshold data structures and coding theory ⋮ A combinatorial problem for vector spaces over finite fields ⋮ Constructing linear codes from some orbits of projectivities ⋮ The Lanczos algorithm and Hankel matrix factorization ⋮ Diameter lower bounds for Waring graphs and multiloop networks ⋮ Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes ⋮ On rank statistics: An approach via metrics on the permutation group ⋮ Constacyclic codes as invariant subspaces ⋮ Inversion components of block Hankel-like matrices ⋮ On some perfect codes with respect to Lee metric ⋮ Weight enumerators of self-orthogonal codes ⋮ Products of linear recurring sequences ⋮ Unrestricted codes with the Golay parameters are unique ⋮ Quotients of Gaussian graphs and their application to perfect codes ⋮ New upper bounds on Lee codes ⋮ On the joint linear complexity profile of explicit inversive multisequences ⋮ Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization ⋮ An analog to the discriminant over fields of characteristic two ⋮ A note on negacyclic self-dual codes over \(\mathbb Z_{2^{a}}\) ⋮ On rational circulants satisfying \(A^2=dI+\lambda J\) ⋮ Codes projectifs à deux ou trois poids associes aux hyperquadriques d'une géométrie finie ⋮ The periods of the sequences generated by some symmetric shift registers ⋮ On the smallest simple, unipotent Bol loop. ⋮ Alternating bilinear forms over GF(q) ⋮ On the maximum number of permutations with given maximal or minimal distance ⋮ 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 ⋮ The weight distribution of irreducible cyclic codes with block lengths \(n_1 ((q^\ell-1)/N)\) ⋮ Codes projectifs à deux poids, caps complets et ensembles de différences ⋮ Significance arithmetic: The probability of carrying ⋮ Binary and ternary signals with small cross correlations ⋮ The depth spectrum of negacyclic codes over \(\mathbb{Z}_4\) ⋮ Bounded distance decoding of linear error-correcting codes with Gröbner bases ⋮ Rational power series, sequential codes and periodicity of sequences ⋮ A linear-algebra problem from algebraic coding theory ⋮ Solving linear systems of determinant frequently zero over finite field GF(2) ⋮ Power series remainder sequences and Padé fractions over an integral domain ⋮ On class weights of CT bursts ⋮ Dual and self-dual negacyclic codes of even length over \(\mathbb Z_{2^a}\) ⋮ Cyclic codes over GF(q) with simple orbit structure ⋮ A simple Hankel interpretation of the Berlekamp-Massey algorithm ⋮ Pencils of quadratic forms over finite fields ⋮ An automaton-theoretic approach to the representation theory of quantum algebras ⋮ Construction of optimal linear codes using flats and spreads in a finite projective geometry ⋮ On the asymptotic behaviour of Lee-codes ⋮ An algorithm for pseudo random number generation suitable for large scale integration ⋮ On the partial realization problem ⋮ The epsilon algorithm and related topics ⋮ Scalable secure storage when half the system is faulty ⋮ An improved algorithm for Davida amd Cowles's decoding method ⋮ Factorization of polynomials and some linear-algebra problems over finite fields ⋮ The decoding of extended Reed-Solomon codes ⋮ Linear recursion properties of uncorrelated binary sequences ⋮ Construction of n variable codes ⋮ Fast Hensel's lifting implementation using partial fraction decomposition
This page was built for publication:
