AI & ML
Characterizations and MacWilliams-Like Identities of Weakly Regular Bent Partitions
arXiv math.IT0 views
arXiv:2610.41779v1 Announce Type: new Abstract: Bent partitions play a significant role in the theory of bent functions. In this paper, we study weakly regular bent partitions, that is, all generated bent functions are weakly regular (called in class $\mathcal{WRBP}$). Let $\Gamma=\{A_{i}, i \in V_{m}\}$ be a bent partition of $V_{n}$ in class $\mathcal{WRBP}$, where $V_{n}$ denotes an $n$-dimensional vector space over the prime field $\mathbb{F}_{p}$, $n$ is even, $m \leq \frac{n}{2}$, and $m \geq 2$ if $p=2$. We first characterize bent partition $\Gamma$ in terms of the duals of component functions of vectorial bent functions. In particular, we prove that if $p \neq 3$, then all bent functions generated by $\Gamma$ are regular. Building on the above result, we give characterizations of bent partition $\Gamma$ in terms of two classes of linear codes. When $n \geq 4$ and $m=\frac{n}{2}$, except for the case where $(p, n)=(2, 4)$ and $|A_{i_{0}}|=1$ for some $i_{0}$, we show that $\Gamma$ is obtained from a spread (after a shift). Particularly, any normal bent partition of $V_{n}$ of depth $p^{\frac{n}{2}}$ in class $\mathcal{WRBP}$ must be obtained from a spread (after a shift), where $n \geq 4$. We establish the Macwilliams-like identities for bent partitions in class $\mathcal{WRBP}$. Furthermore, if $p$ is odd, we present some nonexistence results on bent partitions in class $\mathcal{WRBP}$.
Source:https://arxiv.org/abs/2610.41779PreviousShaping and Finite-Blocklength Analysis of Quaternionic Alamouti-Type CodesNextChannel dichotomies
Related posts
Scrape LinkedIn job postings without logging in (Python + Google Sheets)
0dev.to
Same model, same defences: 7 document attacks down to 0, chat attacks barely moved
0dev.to
Skill to Create Product Videos
0Hacker News
SOML – A Config Format for Humans
0Hacker News
Egoless Mathematics in the AI Era
0Hacker News
LifeVal
0OpenAI Blog