k-autocorrelation and its applications

Abstract

The standard autocorrelation measures similarities between a binary sequence and its any shifted form. In this paper, we introduce the concept of the k-autocorrelation of a binary sequence as a generalization of the standard autocorrelation. We give two applications of the k-autocorrelation. The first one is related the additive circulant codes over F₄ in coding theory. We use the k-autocorrelation to determine the minimum distance of additive circulant codes over F₄. The second one is related the (7,3,1)-BIBD in design theory. The k-autocorrelation coefficients give us information about the lines in the (7,3,1)-BIBD.

Keywords

• Autocorrelation,additive circulant codes,Fano plane

References

1. Danielsen, L.E. and Parker, M.G., Directed Graph Representation of Half-Rate Additive Codes over GF(4), Des. Codes Cryptogr., 59 (2011), 119-130.
2. Hertel, D., Crosscorrelation Properties between Perfect Sequences, Sequences and Their Applications-SETA, 2004.
3. Huffman, W.C. and Pless, V., Fundamentals of Error Correcting Codes, Cambridge University Press, 2003.
4. Ling, S. and Xing, C., Coding Theory, U.K.:, Cambridge Univ. Press, 2004.
5. Stinson, D.R., Combinatorial Designs:, Construction and Analysis, Springer, 2003.
6. White, G. and Grassl, M., A New Minimum Weight Algorithm for Additive Codes, International Symposium on Information Theory; (2006), 1119-1123.