Combinatorial polarization, code loops, and codes of high level

Petr Vojtechovský

International Journal of Mathematics and Mathematical Sciences, 2004, vol. 2004, 1-9

Abstract:

We first find the combinatorial degree of any map f : V → F , where F is a finite field and V is a finite-dimensional vector space over F . We then simplify and generalize a certain construction, due to Chein and Goodaire, that was used in characterizing code loops as finite Moufang loops that possess at most two squares. The construction yields binary codes of high divisibility level with prescribed Hamming weights of intersections of codewords.

Date: 2004
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2004/297460.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2004/297460.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:297460

DOI: 10.1155/S0161171204306241

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().