Standard

On components of the Kerdock codes and the dual of the BCH code C1,3. / Mogilnykh, I. Yu; Solov'eva, F. I.

в: Discrete Mathematics, Том 343, № 2, 111668, 02.2020.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

Mogilnykh, IY & Solov'eva, FI 2020, 'On components of the Kerdock codes and the dual of the BCH code C1,3', Discrete Mathematics, Том. 343, № 2, 111668. https://doi.org/10.1016/j.disc.2019.111668

APA

Mogilnykh, I. Y., & Solov'eva, F. I. (2020). On components of the Kerdock codes and the dual of the BCH code C1,3. Discrete Mathematics, 343(2), [111668]. https://doi.org/10.1016/j.disc.2019.111668

Vancouver

Mogilnykh IY, Solov'eva FI. On components of the Kerdock codes and the dual of the BCH code C1,3. Discrete Mathematics. 2020 февр.;343(2):111668. doi: 10.1016/j.disc.2019.111668

Author

Mogilnykh, I. Yu ; Solov'eva, F. I. / On components of the Kerdock codes and the dual of the BCH code C1,3. в: Discrete Mathematics. 2020 ; Том 343, № 2.

BibTeX

@article{c1cb0b73241a4319bd4eb92cad2e9350,
title = "On components of the Kerdock codes and the dual of the BCH code C1,3",
abstract = "In the paper we investigate the structure of i-components of two classes of codes: the Kerdock codes and the duals of the linear uniformly packed codes with parameters of the primitive double-error-correcting BCH code. We prove that for any admissible length the punctured Kerdock code consists of two i-components and the duals of the linear uniformly packed codes with parameters of the primitive double-error-correcting BCH code is an i-component for any i. We give an alternative proof for the fact presented by De Caen and van Dam in 1999 that the restrictions of the Hamming scheme to the doubly shortened Kerdock codes are association schemes.",
keywords = "Association scheme, BCH code, i-component, Kerdock code, t–design, Uniformly packed code, t-design, ASSOCIATION SCHEMES",
author = "Mogilnykh, {I. Yu} and Solov'eva, {F. I.}",
note = "Publisher Copyright: {\textcopyright} 2019 Copyright: Copyright 2019 Elsevier B.V., All rights reserved.",
year = "2020",
month = feb,
doi = "10.1016/j.disc.2019.111668",
language = "English",
volume = "343",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "2",

}

RIS

TY - JOUR

T1 - On components of the Kerdock codes and the dual of the BCH code C1,3

AU - Mogilnykh, I. Yu

AU - Solov'eva, F. I.

N1 - Publisher Copyright: © 2019 Copyright: Copyright 2019 Elsevier B.V., All rights reserved.

PY - 2020/2

Y1 - 2020/2

N2 - In the paper we investigate the structure of i-components of two classes of codes: the Kerdock codes and the duals of the linear uniformly packed codes with parameters of the primitive double-error-correcting BCH code. We prove that for any admissible length the punctured Kerdock code consists of two i-components and the duals of the linear uniformly packed codes with parameters of the primitive double-error-correcting BCH code is an i-component for any i. We give an alternative proof for the fact presented by De Caen and van Dam in 1999 that the restrictions of the Hamming scheme to the doubly shortened Kerdock codes are association schemes.

AB - In the paper we investigate the structure of i-components of two classes of codes: the Kerdock codes and the duals of the linear uniformly packed codes with parameters of the primitive double-error-correcting BCH code. We prove that for any admissible length the punctured Kerdock code consists of two i-components and the duals of the linear uniformly packed codes with parameters of the primitive double-error-correcting BCH code is an i-component for any i. We give an alternative proof for the fact presented by De Caen and van Dam in 1999 that the restrictions of the Hamming scheme to the doubly shortened Kerdock codes are association schemes.

KW - Association scheme

KW - BCH code

KW - i-component

KW - Kerdock code

KW - t–design

KW - Uniformly packed code

KW - t-design

KW - ASSOCIATION SCHEMES

UR - http://www.scopus.com/inward/record.url?scp=85072997946&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2019.111668

DO - 10.1016/j.disc.2019.111668

M3 - Article

AN - SCOPUS:85072997946

VL - 343

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 2

M1 - 111668

ER -

ID: 21805316