Author of the publication

Weakly Resolvable Block Designs and Nonbinary Codes Meeting the Johnson Bound.

, , and . Probl. Inf. Transm., 58 (1): 1-12 (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Shadows under the word-subword relation., and . Probl. Inf. Transm., 48 (1): 31-46 (2012)Search for a Moving Element with the Minimum Total Cardinality of Tests., and . Probl. Inf. Transm., 55 (4): 396-400 (2019)Symmetric Block Designs and Optimal Equidistant Codes., , and . Probl. Inf. Transm., 56 (3): 245-252 (2020)On m-Near-Resolvable Block Designs and q-ary Constant-Weight Codes., , and . Probl. Inf. Transm., 54 (3): 245-252 (2018)Two-Stage Coding Over the Z-Channel., , and . IEEE Trans. Inf. Theory, 68 (4): 2290-2299 (2022)Correcting a Single Error in Feedback Channels., , , and . Probl. Inf. Transm., 58 (4): 329-340 (2022)Coding with noiseless feedback.. Probl. Inf. Transm., 52 (2): 103-113 (2016)On enumeration of q-ary sequences with a fixed number of occurrences of the subblock 00.. Probl. Inf. Transm., 46 (4): 376-381 (2010)On the Optimality of Trivial (w, r)-Cover-Free Codes., and . Probl. Inf. Transm., 40 (3): 195-201 (2004)The Restricted Word Shadow Problem., and . Information Theory, Combinatorics, and Search Theory, volume 7777 of Lecture Notes in Computer Science, page 364-370. Springer, (2013)