D. Krotov

most citedZ4-linear Hadamard and extended perfect codes

54 citations · 87 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2008★ 1 cited

On mobile sets in the binary hypercube

Yuriy Vasil'ev, Sergey Avgustinovich, Denis Krotov

If two distance-3 codes have the same neighborhood, then each of them is called a mobile set. In the (4k+3)-dimensional binary hypercube, there exists a mobile set of cardinality 2…

cs.IT2007★ 54 cited

Z4-linear Hadamard and extended perfect codes

Denis Krotov

If $N = 2^{k} > 8$ then there exist exactly $[(k - 1) /2]$ pairwise nonequivalent $Z_{4}$ -linear Hadamard $(N, 2 N, N /2)$ -codes and $[(k + 1) /2]$ pairwise nonequivalent $Z_{4}$ -linear extended per…

cs.IT2007★ 21 cited

Z4-Linear Perfect Codes

Denis Krotov

For every $n = 2^{k} > 8$ there exist exactly $[(k + 1) /2]$ mutually nonequivalent $Z_{4}$ -linear extended perfect codes with distance 4. All these codes have different ranks.

math.CO2007★ 11 cited

The poset metrics that allow binary codes of codimension m to be m-, (m-1)-, or (m-2)-perfect

Hyun Kwang Kim, Denis Krotov

A binary poset code of codimension M (of cardinality 2^{N-M}, where N is the code length) can correct maximum M errors. All possible poset metrics that allow codes of codimension M…