Shortest Self-Orthogonal Embeddings of Selected Binary Codes
A submitted coding-theory manuscript on self-orthogonal embeddings, adjacent to the Lean/CodingTheoryLib line.
A coding-theory manuscript on shortest self-orthogonal embeddings of selected binary codes, connected to the formal-math backbone of the portfolio.
problem
Self-orthogonal embeddings of binary codes raise concrete construction and minimality questions that can later benefit from formalization and searchable theorem infrastructure.
key idea
Study selected binary codes through their shortest self-orthogonal embeddings and associated construction constraints.
my role
Research contributor; connected the coding-theory manuscript line to the broader formalization agenda.
methods
- • Coding-theory construction
- • Self-orthogonality analysis
- • Binary-code embedding study
evidence / results
- • Submitted manuscript tracked in the Overleaf paper-candidate index
- • Provides mathematical-domain material for future formalization
why this belongs in the portfolio
- • Keeps the portfolio anchored in actual coding-theory research
- • Feeds the formalized mathematical AI substrate direction
authors
Jae-Hyun Baek et al.
venue / status
Submitted coding-theory manuscript
Submitted/draft manuscript; listed as part of the complete submitted/accepted work inventory.
tags