Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2510.05464v1

Help | Advanced Search

Computer Science > Information Theory

arXiv:2510.05464v1 (cs)
[Submitted on 6 Oct 2025 ]

Title: On Binary Codes That Are Maximal Totally Isotropic Subspaces with Respect to an Alternating Form

Title: 关于相对于交替型的最大完全迷向子空间的二元码

Authors:Patrick King, Mikhail Kotchetov
Abstract: 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.
Abstract: 自对偶二元线性码在长度 n <= 40 的情况下已被广泛研究和分类。 然而,对于当基础内积不是点积时与正交补空间重合的线性码,关注较少。 在本文中,我们引入了一个定义在 F_2^n 上的交替形式,并研究了相对于该形式为极大完全迷向的码。 我们对 n <= 24 的此类码进行了分类,并提出一个类似于 MacWilliams 的恒等式,该恒等式将线性码的重量枚举多项式与其正交补的重量枚举多项式通过我们的交替内积联系起来。 作为应用,我们推导出极大完全迷向码的重量枚举多项式的约束条件。
Subjects: Information Theory (cs.IT)
MSC classes: 94B05 (Primary) 05A05, 13A50, 20C35 (Secondary)
Cite as: arXiv:2510.05464 [cs.IT]
  (or arXiv:2510.05464v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.2510.05464
arXiv-issued DOI via DataCite

Submission history

From: Patrick King [view email]
[v1] Mon, 6 Oct 2025 23:48:48 UTC (28 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2025-10
Change to browse by:
cs
math
math.IT

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号