The following pages link to (Q3893810):
Displaying 47 items.
- On the number of edges in induced subgraphs of a special distance graph (Q325666) (← links)
- Independence numbers of random subgraphs of distance graphs (Q325669) (← links)
- Cryptographic properties of a new national encryption standard of Ukraine (Q334235) (← links)
- The Sperner capacity of linear and nonlinear codes for the cyclic triangle (Q686982) (← links)
- On the de Bruijn torus problem (Q690027) (← links)
- On the maximal number of edges in a uniform hypergraph with one forbidden intersection (Q892713) (← links)
- A [45,13] code with minimal distance 16 (Q917526) (← links)
- The automorphism group of an [18,9,8] quaternary code (Q917527) (← links)
- A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases (Q1120276) (← links)
- Bounds and constructions of asymmetric or unidirectional error-correcting codes (Q1205125) (← links)
- Test case generators and computational results for the maximum clique problem (Q1310979) (← links)
- The maximum clique problem (Q1318271) (← links)
- On the equivalence of certain constant weight codes and combinatorial designs (Q1361726) (← links)
- The combinatorics of binary arrays (Q1365504) (← links)
- Nonlinear \(q\)-ary codes with large code distance (Q1752309) (← links)
- Propelinear codes related to some classes of optimal codes (Q1752310) (← links)
- Distance graphs with large chromatic numbers and small clique numbers (Q1761033) (← links)
- On the number of edges of a uniform hypergraph with a range of allowed intersections (Q2190888) (← links)
- On spectra of linear codes (Q2190889) (← links)
- Estimate of the number of edges in special subgraphs of a distance graph (Q2191968) (← links)
- Upper and lower estimates for the number of some \(k\)-dimensional subspaces of a given weight over a finite field (Q2247806) (← links)
- MDS codes in Doob graphs (Q2285072) (← links)
- On the symmetry group of the Mollard code (Q2364472) (← links)
- On perfect codes that do not contain Preparata-like codes (Q2364474) (← links)
- On extending propelinear structures of the Nordstrom-Robinson code to the Hamming code (Q2364475) (← links)
- A geometric approach to finding new lower bounds of \(A(n,d,w)\) (Q2384016) (← links)
- On the structure of symmetry groups of Vasil'ev codes (Q2388212) (← links)
- Interrelation of the cyclic and weight structure of codes over \(\text{GF}(q)\) and proportionality classes (Q2388216) (← links)
- Sufficient conditions for monotonicity of the undetected error probability for large channel error probabilities (Q2432944) (← links)
- On the construction of transitive codes (Q2432946) (← links)
- On cosets of weight 4 of binary BCH codes with minimum distance 8 and exponential sums (Q2432958) (← links)
- On DNA codes (Q2432960) (← links)
- Geometric WOM codes and coding strategies for multilevel flash memories (Q2436569) (← links)
- Application of a fast simulation method to the estimation of the number of some \(k\)-dimensional subspaces over a finite space (Q2452822) (← links)
- Formation of pseudorandom sequences with improved autocorrelation properties (Q2458104) (← links)
- A probabilistic scheme of independent random elements distributed over a finite lattice. II: The method of lattice moments (Q2571522) (← links)
- Classification of Steiner quadruple systems of order 16 and rank at most 13 (Q2577276) (← links)
- On the error-detecting performance of some classes of block codes (Q2577277) (← links)
- A Lloyd theorem in weakly metric association schemes (Q2641319) (← links)
- Combinatorics associated with inflections and bitangents of plane quartics (Q2854092) (← links)
- Metric complements to subspaces in the Boolean cube (Q2959187) (← links)
- On Importance of a Special Sorting in the Maximum-Weight Clique Algorithm Based on Colour Classes (Q3627689) (← links)
- (Q4997925) (← links)
- (Q4997938) (← links)
- ON THE BERLEKAMP — MASSEY ALGORITHM AND ITS APPLICATION FOR DECODING ALGORITHMS (Q5089874) (← links)
- COMPARISON OF THE BINARY GOLAY CODE WITH THE ALGEBRO-GEOMETRIC CODE (Q5150713) (← links)
- On codes with distances \(d\) and \(n\) (Q6173474) (← links)
