The following pages link to (Q5665102):
Displaying 50 items.
- Long module skew codes are good (Q271652) (← links)
- Feedback vertex set in hypercubes (Q294845) (← links)
- Coding techniques for handling failures in large disk arrays (Q297238) (← links)
- Estimates for distribution of the minimal distance of a random linear code (Q314220) (← links)
- Bounds on the minimum code distance for nonbinary codes based on bipartite graphs (Q375966) (← links)
- Controlled random tests (Q376499) (← links)
- On the number of facets of polytopes representing comparative probability orders (Q382891) (← links)
- Complete tests relative to displacing faults of inputs of circuits (Q493886) (← links)
- Quasi-cyclic Goppa codes with special Goppa polynomials and matched location sets (Q502401) (← links)
- Integer codes correcting single errors and burst asymmetric errors within a byte (Q509896) (← links)
- Correcting errors and erasures via the syndrome variety (Q557068) (← links)
- Lower bounds over codes correcting bursts with a given Lee weight or intensity (Q581362) (← links)
- Maximal partial spreads and the modular \(n\)-queen problem (Q687109) (← links)
- Constructions of new families of nonbinary CSS codes (Q710595) (← links)
- Research on the unbiased probability estimation of error-correcting output coding (Q716385) (← links)
- Bounded distance decoding of linear error-correcting codes with Gröbner bases (Q733503) (← links)
- On class weights of CT bursts (Q753792) (← links)
- Computer algebra tales on Goppa codes and McEliece cryptography (Q782704) (← links)
- Characterization of minimum aberration mixed factorials in terms of consulting designs (Q816532) (← links)
- Interaction balance for symmetrical factorial designs with generalized minimum aberration (Q819432) (← links)
- Generalized Reed-Muller codes over \({\mathbb{Z}_q}\) (Q849363) (← links)
- An efficient method for identifying clear effects in blocked fractional factorial designs (Q850201) (← links)
- Lower bounds for codes correcting moderate-density bursts of fixed length with Lee weight consideration (Q852632) (← links)
- Bursts in \(m\)-metric array codes (Q852633) (← links)
- Minimum secondary aberration fractional factorial split-plot designs in terms of consulting designs (Q862693) (← links)
- Campopiano-type bounds in non-Hamming array coding (Q865455) (← links)
- Coordinating team players within a noisy iterated prisoner's dilemma tournament (Q884480) (← links)
- Completely regular codes and completely transitive codes (Q911558) (← links)
- An elementary derivation of the annihilator polynomial for extremal \((2s+1)\)-designs (Q912851) (← links)
- Some properties of self-reciprocal polynomials (Q921053) (← links)
- Fibonacci matrices, a generalization of the ``Cassini formula'', and a new coding theory (Q936741) (← links)
- Synchronization (Q948067) (← links)
- Gröbner bases and combinatorics for binary codes (Q985374) (← links)
- A commutative algebra approach to linear codes (Q1024390) (← links)
- Construction of optimal linear codes using flats and spreads in a finite projective geometry (Q1054702) (← links)
- On the covering radius of cyclic linear codes and arithmetic codes (Q1065761) (← links)
- On an infinite class of Steiner systems with \(t=3\) and \(k=6\) (Q1076676) (← links)
- A lower bound for polynomial multiplication (Q1086218) (← links)
- Quasicyclic symmetry and the directed divergence in information theory (Q1089308) (← links)
- 2-dimensional arithmetic residue check codes (Q1101065) (← links)
- A note on the computation of the bit error rate for binary block codes (Q1101413) (← links)
- On the recovery of error patterns from signatures obtained in digital system testing (Q1107499) (← links)
- A new concatenated BCH-matrix type-B code (Q1112010) (← links)
- A t-unidirectional error-detecting systematic code (Q1113877) (← links)
- Polynomial division using left shift register (Q1130425) (← links)
- Algebraic theory of block codes detecting independent errors (Q1132060) (← links)
- The weight distribution of linear codes over \(GF(q^l)\) having generator matrix over \(GF(q)\) (Q1135270) (← links)
- Blockwise Lee error-correcting codes (Q1141119) (← links)
- Sets of even type in PG(3,4), alias the binary (85,24) projective geometry code (Q1141655) (← links)
- Necessary and sufficient number of parity checks in codes correcting random errors and bursts with weight constraints under a new metric (Q1143994) (← links)
