TY - JOUR
T1 - Erratum to
T2 - On Completely Regular Codes (Problems of Information Transmission, (2019), 55, 1, (1-45), 10.1134/S0032946019010010)
AU - Borges, J.
AU - Rifà, J.
AU - Zinoviev, V. A.
N1 - Publisher Copyright:
© 2019, Pleiades Publishing, Inc.
PY - 2019/7/1
Y1 - 2019/7/1
N2 - In the original article, the authors made the following mistakes in formulations. 1. Theorem 19 should read as follows: Theorem 19 [60, 61]. If C is a perfect nontrivial e-code in the Johnson scheme J(n,w), w ≤ n/2, then its length n is upper bounded as follows: (Formula presented.). 2. Proposition 17 should read as follows: Proposition 17. If C is a nontrivial perfect e-code in J(n,w), then w is lower bounded as follows: (Formula presented.). The authors apologize for the mistakes.
AB - In the original article, the authors made the following mistakes in formulations. 1. Theorem 19 should read as follows: Theorem 19 [60, 61]. If C is a perfect nontrivial e-code in the Johnson scheme J(n,w), w ≤ n/2, then its length n is upper bounded as follows: (Formula presented.). 2. Proposition 17 should read as follows: Proposition 17. If C is a nontrivial perfect e-code in J(n,w), then w is lower bounded as follows: (Formula presented.). The authors apologize for the mistakes.
UR - http://www.scopus.com/inward/record.url?scp=85073634317&partnerID=8YFLogxK
U2 - 10.1134/S0032946019030098
DO - 10.1134/S0032946019030098
M3 - Article
AN - SCOPUS:85073634317
SN - 0032-9460
VL - 55
SP - 298
JO - Problems of Information Transmission
JF - Problems of Information Transmission
IS - 3
ER -