scientific article; zbMATH DE number 3318360

Cited in

(only showing first 100 items - show all)

Rational power series, sequential codes and periodicity of sequences
Dual and self-dual negacyclic codes of even length over \(\mathbb Z_{2^a}\)
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
An algorithm for pseudo random number generation suitable for large scale integration
On the partial realization problem
Construction of n variable codes
Fast Hensel's lifting implementation using partial fraction decomposition
An improvement of the Griesmer bound for some small minimum distances
Upper bounds for constant weight and Lee codes slightly outside the Plotkin range
The complexity of a periodic sequence over GF(p)
Univariate polynomial factorization over finite fields
Polynomial division using left shift register
The weight distribution of linear codes over GF(q^l) having generator matrix over GF(q)
Necessary and sufficient number of parity checks in codes correcting random errors and bursts with weight constraints under a new metric
On primitive elements of trace equal to 1 in GF(\(2^ m)\)
Computing lower bounds on tensor rank over finite fields
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
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 combinatorial problem for vector spaces over finite fields
The Lanczos algorithm and Hankel matrix factorization
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
Inversion components of block Hankel-like matrices
Weight enumerators of self-orthogonal codes
Unrestricted codes with the Golay parameters are unique
An analog to the discriminant over fields of characteristic two
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
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₁ ((q^-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
A linear-algebra problem from algebraic coding theory
Solving linear systems of determinant frequently zero over finite field GF(2)
An improved algorithm for Davida amd Cowles's decoding method
Factorization of polynomials and some linear-algebra problems over finite fields
A complete decoding algorithm for double-error-correcting primitive binary BCH codes of odd m
Parallel computation of polynomial GCD and some related parallel computations over abstract fields
The combinatorics of discrete self-similarity
On domination numbers of Cartesian products of paths
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
New minimum distance bounds for linear codes over GF(5).
The epsilon algorithm and related topics
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
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
Scalable secure storage when half the system is faulty
Bent functions and random Boolean formulas
The BCH-Goppa decoding as a moment problem and a tau function over finite fields.
Threshold data structures and coding theory
Products of linear recurring sequences
Repeated-root constacyclic codes of length \(n l p^s\)
Independent domination in hypercubes
A q-polynomial approach to constacyclic codes
Monomial codes seen as invariant subspaces
Constructing linear codes from some orbits of projectivities
On some perfect codes with respect to Lee metric
New upper bounds on Lee codes
An error-correcting code framework for genetic sequence analysis
Multi-continued fraction algorithm and generalized B--M algorithm over \(\mathbb F_{q}\)
Incomplete block design codes for ultra high speed computer applications
A survey of constructive coding theory, and a table of binary codes of highest known rate
Weights of linear codes and strongly regular normed spaces
Nearly perfect binary codes
Consecutive zeros in convolutional codewords
A classification of self-orthogonal codes over GF(2)
A new algorithm for computing orthogonal polynomials
An efficient binary sequence generator with cryptographic applications
Fast, prime factor, discrete Fourier transform algorithms over \(\text{GF}(2^m)\) for \(8 \leqslant m \leqslant 10\)
Block diagonalization and LU-equivalence of Hankel matrices
A new approach towards the Golomb-Welch conjecture
Deterministic distinct-degree factorization of polynomials over finite fields
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
On structure and distances of some classes of repeated-root constacyclic codes over Galois rings
Periodic sequences with maximal N-adic complexity and large k-error N-adic complexity over Z/(N)
Fixed-point tile sets and their applications
A general representation theory for constructing groups of permutation polynomials
On the joint linear complexity profile of explicit inversive multisequences
On subspaces contained in subsets of finite homogeneous spaces
A note on perfect Lee-codes over small alphabets
A note on perfect Lee-codes over small alphabets
On the classification and enumeration of self-dual codes
Factoring polynomials over finite fields: A survey

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5598073)