The algebraic degree of 1-perfect binary codes and a relation with the code characters
Dan Corneliu Popescu · 2008
We give a complete characterization for the range of the algebraic degree of 1-perfect binary codes. We show that the algebraic degree range is a compact interval, and that the Vasil'ev construction produces perfect with algebraic degrees covering the entire range. We also hint at a link between the algebraic degree of a perfect binary code and the coefficients of the code character.