Combinatorial vs. Algebraic Characterizations of Completely Pseudo-Regular Codes
نویسندگان
چکیده
منابع مشابه
Combinatorial vs. Algebraic Characterizations of Completely Pseudo-Regular Codes
Given a simple connected graph Γ and a subset of its vertices C, the pseudodistance-regularity around C generalizes, for not necessarily regular graphs, the notion of completely regular code. We then say that C is a completely pseudoregular code. Up to now, most of the characterizations of pseudo-distance-regularity has been derived from a combinatorial definition. In this paper we propose an a...
متن کاملCombinatorial vs. Algebraic Characterizations of Pseudo-Distance-Regularity Around a Set
Given a simple connected graph Γ and a subset of its vertices C, the pseudodistance-regularity around C generalizes, for not necessarily regular graphs, the notion of completely regular code. Up to know, most of the characterizations of pseudodistance-regularity has been derived from a combinatorial definition. In this paper we propose an algebraic (Terwilliger-like) approach to this notion, sh...
متن کاملCharacterizing completely regular codes from an algebraic viewpoint
The class of completely regular codes includes not only some of the most important error-correcting codes, such as perfect codes and uniformly packed codes, but also a number of substructures fundamental to the study of distance-regular graphs themselves. In a companion paper, we study products of completely regular codes and codes whose parameters form arithmetic progressions. This family of c...
متن کاملArithmetic completely regular codes
In this paper, we explore completely regular codes in the Hamming graphs and related graphs. Experimental evidence suggests that many completely regular codes have the property that the eigenvalues of the code are in arithmetic progression. In order to better understand these “arithmetic completely regular codes”, we focus on cartesian products of completely regular codes and products of their ...
متن کاملCombinatorial Characterizations of Authentication Codes
In this paper, we prove two new combinatorial characterizations of authentication codes. Authentication codes without secrecy are characterized in terms of orthogonal arrays; and general authentication codes are characterized in terms of balanced incomplete block designs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2010
ISSN: 1077-8926
DOI: 10.37236/309