scientific article; zbMATH DE number 3410920
From MaRDI portal
Publication:5675263
zbMath0259.94022MaRDI QIDQ5675263
Publication date: 1965
Full work available at URL: http://mathnet.ru/eng/ppi/v1/i4/p41
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory, Bounds on the minimum code distance for nonbinary codes based on bipartite graphs, Algebraic theory of block codes detecting independent errors, Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes, Sphere packing bounds via spherical codes, An Upper Bound on the Size of Sidon Sets, On the number of edges of a uniform hypergraph with a range of allowed intersections, On \(q\)-ary codes with two distances \(d\) and \(d+1\), A family of diameter perfect constant-weight codes from Steiner systems, Weakly resolvable block designs and nonbinary codes meeting the Johnson bound, An application of coding theory to estimating Davenport constants, Symmetric block designs and optimal equidistant codes, Bounds for the capacity error function for unidirectional channels with noiseless feedback, List decoding of the first-order binary Reed-Muller codes, On the construction of \(q\)-ary equidistant codes, Remark on balanced incomplete block designs, near-resolvable block designs, and \(q\)-ary constant-weight codes, Upper bound on the minimum distance of LDPC codes over \(\mathrm{GF}(q)\) based on counting the number of syndromes, List decodability at small radii, Some simple consequences of coding theory for combinatorial problems of packings and coverings, Coding in a Z-channel in case of many errors, On \(m\)-near-resolvable block designs and \(q\)-ary constant-weight codes, Rank-Metric Codes and Their Applications, Optimal almost equisymbol codes based on difference matrices
