International Conference on Computer Science and Information Processing
A class of imprimitive BCH codes and new quantum codes
Yang Liu, Yuena Ma, Ruihu Li, Youqian Feng
Abstract
Let q be a prime power, l ≥ 2 be even, n=(q-1)(qil-1)/(qi-1). We give necessary and sufficient conditions on dual containing q-ary narrow-sense BCH codes of lengthn, and improve previous upper bound on necessary condition. We present a family of dual containing non-narrow-sense BCH codes of lengthnincluding the BCH code with maximal designed distance, calculate their dimensions and use them to construct new quantum codes, which are better than those constructed from narrow-sense BCH codes.