کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
420536 683952 2009 6 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Construction of binary and ternary self-orthogonal linear codes
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Construction of binary and ternary self-orthogonal linear codes
چکیده انگلیسی

We construct new binary and ternary self-orthogonal linear codes. In order to do this we use an equivalence between the existence of a self-orthogonal linear code with a prescribed minimum distance and the existence of a solution of a certain system of Diophantine linear equations. To reduce the size of the system of equations we restrict the search for solutions to solutions with special symmetry given by matrix groups. Using this method we found at least six new distance-optimal codes, which are all self-orthogonal.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 157, Issue 9, 6 May 2009, Pages 2118–2123
نویسندگان
, ,