The Algebraic Degree of Perfect Binary Codes
Dan Corneliu Popescu · IEEE Transactions on Information Theory · 2008
In this communication, we give a complete characterization for the range of the algebraic degree of perfect binary codes. For 1 -perfect binary codes, we show that for anydin the algebraic degree range, there are Vasil'ev codes with algebraic degreed. It is also shown that the algebraic degree of 1-perfect binary codes is independent of the rank and the dimension of the kernel.