Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
Reconstructing Sets of Latin Squares, Linear and Equivalent to Linear Codes. / Gorkunov, Evgeny V.; Danilko, Vitaly R.
2019 16th International Symposium "Problems of Redundancy in Information and Control Systems", REDUNDANCY 2019. Institute of Electrical and Electronics Engineers Inc., 2019. p. 47-51 9003314 (2019 16th International Symposium "Problems of Redundancy in Information and Control Systems", REDUNDANCY 2019).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
}
TY - GEN
T1 - Reconstructing Sets of Latin Squares, Linear and Equivalent to Linear Codes
AU - Gorkunov, Evgeny V.
AU - Danilko, Vitaly R.
N1 - Funding Information: This research is supported by the Russian Foundation for Basic Research (Project 19–01–00682) and the Programme for Fundamental Scientific Research of SB RAS No. I.5.1 (Project 0314–2019–0016).
PY - 2019/10
Y1 - 2019/10
N2 - We consider the reconstruction problem concerning latin squares, sets of mutually orthogonal latin squares as well as linear and equivalent to linear codes in a vector space over a finite field. With regard to this problem we discuss related topics on intersection of combinatorial objects of the same class. An algorithm reconstructing latin squares and its sets is presented. By this way it is shown for q 3, 4, 5, 7 that the Bose complete set of mutually orthogonal latin squares of order q with 2q-1 or less blank entries in each square at the same places is reconstructed uniquely. We also point some recently obtained results on the maximum intersection of linear and equivalent to linear codes, and their applications as well.
AB - We consider the reconstruction problem concerning latin squares, sets of mutually orthogonal latin squares as well as linear and equivalent to linear codes in a vector space over a finite field. With regard to this problem we discuss related topics on intersection of combinatorial objects of the same class. An algorithm reconstructing latin squares and its sets is presented. By this way it is shown for q 3, 4, 5, 7 that the Bose complete set of mutually orthogonal latin squares of order q with 2q-1 or less blank entries in each square at the same places is reconstructed uniquely. We also point some recently obtained results on the maximum intersection of linear and equivalent to linear codes, and their applications as well.
KW - complete set of MOLS
KW - equivalent codes
KW - finite field
KW - intersection
KW - isometry
KW - isotopy
KW - latin square
KW - linear code
KW - MDS code
KW - MOLS
KW - pseudolinear code
KW - reconstructing algorithm
UR - http://www.scopus.com/inward/record.url?scp=85081539289&partnerID=8YFLogxK
U2 - 10.1109/REDUNDANCY48165.2019.9003314
DO - 10.1109/REDUNDANCY48165.2019.9003314
M3 - Conference contribution
AN - SCOPUS:85081539289
T3 - 2019 16th International Symposium "Problems of Redundancy in Information and Control Systems", REDUNDANCY 2019
SP - 47
EP - 51
BT - 2019 16th International Symposium "Problems of Redundancy in Information and Control Systems", REDUNDANCY 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 16th International Symposium "Problems of Redundancy in Information and Control Systems", REDUNDANCY 2019
Y2 - 21 October 2019 through 25 October 2019
ER -
ID: 26207524