کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4599358 1631132 2014 10 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Centraliser codes
ترجمه فارسی عنوان
کدهای متمرکز
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات اعداد جبر و تئوری
چکیده انگلیسی
Centraliser codes are codes of length n2 defined as centralisers of a given matrix A of order n. Their dimension, parity-check matrices, syndromes, and automorphism groups are investigated. A lower bound on the dimension is n, the order of A. This bound is met when the minimal polynomial is equal to the annihilator, i.e. for so-called cyclic (a.k.a. non-derogatory) matrices. If, furthermore, the matrix is separable and the adjacency matrix of a graph, the automorphism group of that graph is shown to be abelian and to be even trivial if the alphabet field is of even characteristic.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Linear Algebra and its Applications - Volume 463, 15 December 2014, Pages 68-77
نویسندگان
, , , , , ,