scientific article; zbMATH DE number 3410920
From MaRDI portal
Publication:5675263
zbMATH Open0259.94022MaRDI QIDQ5675263FDOQ5675263
Authors: L. A. Bassalygo 
Publication date: 1965
Full work available at URL: http://mathnet.ru/eng/ppi/v1/i4/p41
Title of this publication is not available (Why is that?)
Cited In (34)
- Weakly resolvable block designs and nonbinary codes meeting the Johnson bound
- Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes
- Sphere packing bounds via spherical codes
- Remark on balanced incomplete block designs, near-resolvable block designs, and \(q\)-ary constant-weight codes
- Bounds for the capacity error function for unidirectional channels with noiseless feedback
- A new upper bound on nonbinary block codes
- On \(q\)-ary codes with two distances \(d\) and \(d+1\)
- Title not available (Why is that?)
- On the number of edges of a uniform hypergraph with a range of allowed intersections
- Symmetric block designs and optimal equidistant codes
- Constructions of nonbinary codes meeting the Johnson bound
- Correcting a single error in an asymmetric feedback channel
- List decodability at small radii
- Upper bounds on the rate of LDPC codes
- Optimal almost equisymbol codes based on difference matrices
- Some simple consequences of coding theory for combinatorial problems of packings and coverings
- Algebraic theory of block codes detecting independent errors
- A new upper bound on the rate of non-binary codes
- New upper bounds on error exponents
- Fixed points of Boolean networks, guessing graphs, and coding theory
- Coding in a Z-channel in case of many errors
- A family of diameter perfect constant-weight codes from Steiner systems
- Title not available (Why is that?)
- Improved upper bounds on sizes of codes
- Minimal abundant packings and choosability with separation
- New upper bounds on Lee codes
- Rank-metric codes and their applications
- An Upper Bound on the Size of Sidon Sets
- On the construction of \(q\)-ary equidistant codes
- An application of coding theory to estimating Davenport constants
- On \(m\)-near-resolvable block designs and \(q\)-ary constant-weight codes
- Bounds on the minimum code distance for nonbinary codes based on bipartite graphs
- List decoding of the first-order binary Reed-Muller codes
- Upper bound on the minimum distance of LDPC codes over \(\mathrm{GF}(q)\) based on counting the number of syndromes
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 Q5675263)
