The following pages link to (Q5598073):
Displaying 50 items.
- A new algebraic algorithm to decode the ternary Golay code (Q293465) (← links)
- A database of linear codes over \(\mathbb F_{13}\) with minimum distance bounds and new quasi-twisted codes from a heuristic search algorithm (Q307897) (← links)
- Recent progress on weight distributions of cyclic codes over finite fields (Q307903) (← links)
- On structure and distances of some classes of repeated-root constacyclic codes over Galois rings (Q346282) (← links)
- Periodic sequences with maximal \(N\)-adic complexity and large \(k\)-error \(N\)-adic complexity over \(Z/(N)\) (Q413471) (← links)
- Fixed-point tile sets and their applications (Q439933) (← links)
- A general representation theory for constructing groups of permutation polynomials (Q491994) (← links)
- On the joint linear complexity profile of explicit inversive multisequences (Q558009) (← links)
- Diameter lower bounds for Waring graphs and multiloop networks (Q686473) (← links)
- Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization (Q712251) (← links)
- A note on negacyclic self-dual codes over \(\mathbb Z_{2^{a}}\) (Q713144) (← links)
- The depth spectrum of negacyclic codes over \(\mathbb{Z}_4\) (Q729764) (← links)
- Bounded distance decoding of linear error-correcting codes with Gröbner bases (Q733503) (← links)
- Power series remainder sequences and Padé fractions over an integral domain (Q749215) (← links)
- On class weights of CT bursts (Q753792) (← links)
- On the asymptotic behaviour of Lee-codes (Q793695) (← links)
- The decoding of extended Reed-Solomon codes (Q803107) (← links)
- Linear recursion properties of uncorrelated binary sequences (Q804580) (← links)
- Lower bounds for codes correcting moderate-density bursts of fixed length with Lee weight consideration (Q852632) (← links)
- Programmable cellular automata based Montgomery hardware architecture (Q876683) (← links)
- Error linear complexity measures for multisequences (Q883329) (← links)
- A new upper bound on nonbinary block codes (Q920930) (← links)
- Some properties of self-reciprocal polynomials (Q921053) (← links)
- Primitive elements and polynomials with arbitrary trace (Q922593) (← links)
- Constacyclic codes as invariant subspaces (Q959893) (← links)
- Quotients of Gaussian graphs and their application to perfect codes (Q975827) (← links)
- On the smallest simple, unipotent Bol loop. (Q986116) (← links)
- Rational power series, sequential codes and periodicity of sequences (Q1008766) (← links)
- Dual and self-dual negacyclic codes of even length over \(\mathbb Z_{2^a}\) (Q1025494) (← links)
- An automaton-theoretic approach to the representation theory of quantum algebras (Q1047663) (← links)
- Construction of optimal linear codes using flats and spreads in a finite projective geometry (Q1054702) (← links)
- An algorithm for pseudo random number generation suitable for large scale integration (Q1055154) (← links)
- On the partial realization problem (Q1055376) (← links)
- Construction of n variable codes (Q1068790) (← links)
- Fast Hensel's lifting implementation using partial fraction decomposition (Q1074651) (← links)
- An improvement of the Griesmer bound for some small minimum distances (Q1083427) (← links)
- Upper bounds for constant weight and Lee codes slightly outside the Plotkin range (Q1095110) (← links)
- The complexity of a periodic sequence over GF(p) (Q1113874) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- Polynomial division using left shift register (Q1130425) (← links)
- The weight distribution of linear codes over \(GF(q^l)\) having generator matrix over \(GF(q)\) (Q1135270) (← links)
- Necessary and sufficient number of parity checks in codes correcting random errors and bursts with weight constraints under a new metric (Q1143994) (← links)
- On primitive elements of trace equal to 1 in GF(\(2^ m)\) (Q1164095) (← links)
- Computing lower bounds on tensor rank over finite fields (Q1165577) (← links)
- A generalization of the BCH bound for cyclic codes, including the Hartmann-Tzeng bound (Q1171042) (← links)
- On the parameters of codes for the Lee and modular distance (Q1176746) (← links)
- A functional version of Hilbert's theorem 90 (Q1177269) (← links)
- A semi-systolic decoder for the PDSC-73 error-correcting code (Q1180157) (← links)
- Two-dimensional shift register synthesis and Gröbner bases for polynomial ideals over an integer residue ring (Q1180162) (← links)
- Probability models on rankings (Q1184253) (← links)
