On Binary Codes That Are Maximal Totally Isotropic Subspaces with Respect to an Alternating Form
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913103945400320 |
|---|---|
| author | King, Patrick Kotchetov, Mikhail |
| author_facet | King, Patrick Kotchetov, Mikhail |
| contents | Self-dual binary linear codes have been extensively studied and classified for length n <= 40. However, little attention has been paid to linear codes that coincide with their orthogonal complement when the underlying inner product is not the dot product. In this paper, we introduce an alternating form defined on F_2^n and study codes that are maximal totally isotropic with repsect to this form. We classify such codes for n <= 24 and present a MacWilliams-type identity which relates the weight enumerator of a linear code and that of its orthogonal complement with respect to our alternating inner product. As an application, we derive constraints on the weight enumerators of maximal totally isotropic codes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_05464 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On Binary Codes That Are Maximal Totally Isotropic Subspaces with Respect to an Alternating Form King, Patrick Kotchetov, Mikhail Information Theory 94B05 (Primary) 05A05, 13A50, 20C35 (Secondary) Self-dual binary linear codes have been extensively studied and classified for length n <= 40. However, little attention has been paid to linear codes that coincide with their orthogonal complement when the underlying inner product is not the dot product. In this paper, we introduce an alternating form defined on F_2^n and study codes that are maximal totally isotropic with repsect to this form. We classify such codes for n <= 24 and present a MacWilliams-type identity which relates the weight enumerator of a linear code and that of its orthogonal complement with respect to our alternating inner product. As an application, we derive constraints on the weight enumerators of maximal totally isotropic codes. |
| title | On Binary Codes That Are Maximal Totally Isotropic Subspaces with Respect to an Alternating Form |
| topic | Information Theory 94B05 (Primary) 05A05, 13A50, 20C35 (Secondary) |
| url | https://arxiv.org/abs/2510.05464 |