×

Found 133 Documents (Results 1–100)

Bounds on threshold probabilities for coloring properties of random hypergraphs. (English. Russian original) Zbl 1518.05067

Probl. Inf. Transm. 58, No. 1, 72-101 (2022); translation from Probl. Peredachi Inf. 58, No. 1, 80-111 (2022).
PDFBibTeX XMLCite
Full Text: DOI

New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\). (English. Russian original) Zbl 1481.05126

Probl. Inf. Transm. 57, No. 4, 380-401 (2021); translation from Probl. Peredachi Inf. 57, No. 4, 87-109 (2021).
PDFBibTeX XMLCite
Full Text: DOI

Limit theorems for the maximal path weight in a directed graph on the line with random weights of edges. (English. Russian original) Zbl 1469.05064

Probl. Inf. Transm. 57, No. 2, 161-177 (2021); translation from Probl. Peredachi Inf. 57, No. 2, 71-89 (2021).
MSC:  05C20 05C38 05C22
PDFBibTeX XMLCite
Full Text: DOI arXiv

Bounds on Borsuk numbers in distance graphs of a special type. (English. Russian original) Zbl 1470.05021

Probl. Inf. Transm. 57, No. 2, 136-142 (2021); translation from Probl. Peredachi Inf. 57, No. 2, 44-50 (2021).
PDFBibTeX XMLCite
Full Text: DOI

Detecting cycles of length 10 in the Tanner graph of a QC-LDPC code based on protograph analysis. (English. Russian original) Zbl 1478.94126

Probl. Inf. Transm. 56, No. 4, 317-331 (2020); translation from Probl. Peredachi Inf. 56, No. 4, 19-34 (2020).
MSC:  94B05 05C48
PDFBibTeX XMLCite
Full Text: DOI

Symmetric block designs and optimal equidistant codes. (English. Russian original) Zbl 1461.05016

Probl. Inf. Transm. 56, No. 3, 245-252 (2020); translation from Probl. Peredachi Inf. 56, No. 5, 50-58 (2020).
MSC:  05B05 94B25
PDFBibTeX XMLCite
Full Text: DOI

On the number of edges of a uniform hypergraph with a range of allowed intersections. (English. Russian original) Zbl 1442.05143

Probl. Inf. Transm. 53, No. 4, 319-342 (2017); translation from Probl. Peredachi Inf. 53, No. 4, 16-42 (2017).
MSC:  05C65 94B65
PDFBibTeX XMLCite
Full Text: DOI

Remark on balanced incomplete block designs, near-resolvable block designs, and \(q\)-ary constant-weight codes. (English. Russian original) Zbl 1387.94128

Probl. Inf. Transm. 53, No. 1, 51-54 (2017); translation from Probl. Peredachi Inf. 53, No. 1, 56-59 (2017).
MSC:  94B25 05B30
PDFBibTeX XMLCite
Full Text: DOI

Generalized Preparata codes and 2-resolvable Steiner quadruple systems. (English. Russian original) Zbl 1369.94609

Probl. Inf. Transm. 52, No. 2, 114-133 (2016); translation from Probl. Peredachi Inf. 52, No. 2, 15-36 (2016).
MSC:  94B25 05B30
PDFBibTeX XMLCite
Full Text: DOI

Minimum number of edges in a hypergraph guaranteeing a perfect fractional matching and the MMS conjecture. (English. Russian original) Zbl 1316.05089

Probl. Inf. Transm. 50, No. 4, 340-349 (2014); translation from Probl. Peredachi Inf. 50, No. 4, 43-54 (2014).
MSC:  05C65 05C35 05C70
PDFBibTeX XMLCite
Full Text: DOI arXiv

New estimates in the problem of the number of edges in a hypergraph with forbidden intersections. (English. Russian original) Zbl 1308.05083

Probl. Inf. Transm. 49, No. 4, 384-390 (2013); translation from Prob. Peredachi Inf. 49, No. 4, 98-104 (2013).
MSC:  05C65
PDFBibTeX XMLCite
Full Text: DOI

Structure of Steiner triple systems \(S(2^m-1,3,2)\) of rank \(2^m-m+2\) over \(\mathbb F_2\). (English. Russian original) Zbl 1308.05025

Probl. Inf. Transm. 49, No. 3, 232-248 (2013); translation from Prob. Peredachi Inf. 49, No. 3, 40-56 (2013).
MSC:  05B07
PDFBibTeX XMLCite
Full Text: DOI

Remark on “Steiner triple systems \(S(2^m-1,3,2)\) of rank \(2^m-m+1\) over \(\mathbb F_2\)”. (English. Russian original) Zbl 1276.05013

Probl. Inf. Transm. 49, No. 2, 192-195 (2013); translation from Probl. Peredachi Inf. 49, No. 2, 107-111 (2013).
MSC:  05B07
PDFBibTeX XMLCite
Full Text: DOI

Construction of self-orthogonal codes from combinatorial designs. (English. Russian original) Zbl 1267.94137

Probl. Inf. Transm. 48, No. 3, 250-258 (2012); translation from Probl. Peredachi Inf. 48, No. 3, 60-69 (2012).
MSC:  94B05 05B05 94B25
PDFBibTeX XMLCite
Full Text: DOI

Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph. (English. Russian original) Zbl 1236.05063

Probl. Inf. Transm. 47, No. 3, 269-273 (2011); translation from Probl. Peredachi Inf. 47, No. 3, 59-63 (2011).
MSC:  05C07 05C85
PDFBibTeX XMLCite
Full Text: DOI

Classification of optimal \((v, 4, 1)\) binary cyclically permutable constant-weight codes and cyclic \(2\)-\((v, 4, 1)\) designs with \(v \leq 76\). (English. Russian original) Zbl 1241.05015

Probl. Inf. Transm. 47, No. 3, 224-231 (2011); translation from Probl. Peredachi Inf. 47, No. 3, 10-18 (2011).
PDFBibTeX XMLCite
Full Text: DOI

New \((n, r)\)-arcs in \(\mathrm{PG}(2, 17)\), \(\mathrm{PG}(2, 19)\), and \(\mathrm{PG}(2, 23)\). (English. Russian original) Zbl 1254.51004

Probl. Inf. Transm. 47, No. 3, 217-223 (2011); translation from Probl. Peredachi Inf. 47, No. 3, 3-9 (2011).
PDFBibTeX XMLCite
Full Text: DOI

On symmetric matrices with indeterminate leading diagonals. (English. Russian original) Zbl 1194.15033

Probl. Inf. Transm. 45, No. 3, 258-263 (2009); translation from Probl. Peredachi Inf. 45, No. 3, 73-78 (2009).
MSC:  15B57 15A63 05C50
PDFBibTeX XMLCite
Full Text: DOI

Fourier-invariant pairs of partitions of finite Abelian groups and association schemes. (English. Russian original) Zbl 1202.94217

Probl. Inf. Transm. 45, No. 3, 221-231 (2009); translation from Probl. Peredachi Inf. 45, No. 3, 33-44 (2009).
MSC:  94B05 05E30 20K01
PDFBibTeX XMLCite
Full Text: DOI

On resolvability of Steiner systems \(S ( v = 2^{ m }, 4, 3)\) of rank \(r \leq v - m + 1\) over \(\mathbb{F}_{2}\). (English. Russian original) Zbl 1236.05036

Probl. Inf. Transm. 43, No. 1, 33-47 (2007); translation from Probl. Peredachi Inf. 43, No. 1, 39-55 (2007).
MSC:  05B07 05B05 51E10
PDFBibTeX XMLCite
Full Text: DOI

Poisson hypothesis: combinatorial aspect. (English. Russian original) Zbl 1105.60070

Probl. Inf. Transm. 41, No. 3, 230-236 (2005); translation from Probl. Peredachi Inf. 2005, No. 3, 51-57 (2005).
PDFBibTeX XMLCite
Full Text: DOI

Construction of perfect \(q\)-ary codes by sequential switchings of \(\tilde\alpha\)-components. (English. Russian original) Zbl 1085.94022

Probl. Inf. Transm. 40, No. 1, 37-43 (2004); translation from Probl. Peredachi Inf. 40, No. 1, 40-47 (2004).
PDFBibTeX XMLCite
Full Text: DOI

To the metrical rigidity of binary codes. (English. Russian original) Zbl 1089.94039

Probl. Inf. Transm. 39, No. 2, 178-183 (2003); translation from Prob. Peredachi Inf. 39, No. 2, 23-28 (2003).
MSC:  94B25 05B05
PDFBibTeX XMLCite
Full Text: DOI

Binary extended perfect codes of length 16 by the generalized concatenated construction. (English. Russian original) Zbl 1027.94030

Probl. Inf. Transm. 38, No. 4, 296-322 (2002); translation from Probl. Peredachi Inf. 38, No. 4, 56-84 (2002).
MSC:  94B25 05A15 05B15
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

all top 5

Author

all top 5

Volume

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software