IMI-BAS BAS
 

BulDML at Institute of Mathematics and Informatics >
IMI >
Innovative STEM Education >
STEM, vol.3, 2021 >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10525/4193

Title: On the Calculation of the Minimum Distance of a Linear Code
Other Titles: Пресмятане на минималното разстояние на линеен код
Authors: Bouyukliev, Iliya
Keywords: Linear Codes
Minimum Distance
Algorithms
Issue Date: 29-Jun-2021
Publisher: Institute of Mathematics and Informatics – Bulgarian Academy of Sciences
Citation: Bouyukliev, I. (2021). On the Calculation of the Minimum Distance of a Linear Code, Science Series "Innovative STEM Education", volume 03, ISSN: 2683-1333, Institute of Mathematics and Informatics – Bulgarian Academy of Sciences, 146-150. DOI: https://doi.org/10.55630/STEM.2021.0317
Series/Report no.: Science Series "Innovative STEM Education", volume 03;17
Abstract: Some aspects of the algorithms for calculating the minimum distance of linear codes over finite fields are presented.
URI: http://hdl.handle.net/10525/4193
ISSN: 2683-1333
https://doi.org/10.55630/STEM.2021.0317
Appears in Collections:STEM, vol.3, 2021

Files in This Item:

File Description SizeFormat
17-STEMedu-2021.pdf634.84 kBAdobe PDFView/Open

 



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0!   Creative Commons License