On the b-Symbol Weight Distribution of Dual Melas Codes and a Poisson Randomness Postulate

Abstract

We prove a new lower bound on the b-symbol weight of codewords in dual Melas codes, which is strictly better than known results. We employ a new strategy that translates a pattern counting problem in linear-feedback shift register sequences to a problem on orbits of binary polynomials under a certain action. We use the same techniques to provide an improved lower bound on the burst-covering radius of Melas codes and a new upper bound on the critical exponent of dual Melas codes. We then define a new randomness postulate on (families of) binary sequences, based on the definition of infinite Poisson generic sequences. We conjecture that codewords in the dual Melas code satisfy this postulate, and we show partial progress in establishing this conjecture. We also show how a relaxed version of the problem can be completely resolved, and relate the conjecture to the first part of the paper, giving a justification of why the improved bounds on the b-symbol weight were somewhat to be expected.

Embedding Information in Policy Randomness: Distribution-Preserving Implicit Communication in MDPs
Gongpu Chen, Deniz Gündüz
arXiv11 Oct 2026PreprintarXiv licenceFull textGeneral mathematicsarXiv
On the weight distribution bound for the negative eigenvalue of polar collinearity graphs
Sam Adriaensen, Jim Wittebol
arXiv18 Oct 2026PreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
Two Legendre-symbol determinants of Sun and Bernoulli numbers
Hang Liu
arXiv20 Sep 2026PreprintCC BY 4.0Full textAlgebra & number theory Combinatorics & discrete mathematicsarXiv
A Proof of a Conjecture of Zhi-Wei Sun on a Truncated Legendre-Symbol Determinant
Yaoran Yang, Gaishi Yang, Yutong Zhang
arXiv8 Sep 2026PreprintCC BY-NC-ND 4.0Full textAlgebra & number theoryarXiv
DS and AMDS Symbol-Pair Codes from Three Families of Simple Root Cyclic Codes
Jiawei He, Zihan Zhang, Xiaoqiang Wang +1
arXiv10 Oct 2026PreprintCC BY 4.0Full textGeneral mathematicsarXiv

Cite

BibTeX RIS

BibTeX

@misc{himelfarb2026bsymbol,
  title = {{On the $b$-Symbol Weight Distribution of Dual Melas Codes and a Poisson Randomness Postulate}},
  author = {Gabriel Sac Himelfarb and Moshe Schwartz},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.38017},
  eprint = {2610.38017},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.38017},
}

RIS

TY  - UNPB
TI  - On the b-Symbol Weight Distribution of Dual Melas Codes and a Poisson Randomness Postulate
AU  - Gabriel Sac Himelfarb
AU  - Moshe Schwartz
PY  - 2026
DA  - 2026/10/27
PB  - arXiv
DO  - 10.48550/arxiv.2610.38017
UR  - https://arxiv.org/abs/2610.38017
AB  - We prove a new lower bound on the b-symbol weight of codewords in dual Melas codes, which is strictly better than known results. We employ a new strategy that translates a pattern counting problem in linear-feedback shift register sequences to a problem on orbits of binary polynomials under a certain action. We use the same techniques to provide an improved lower bound on the burst-covering radius of Melas codes and a new upper bound on the critical exponent of dual Melas codes. We then define a new randomness postulate on (families of) binary sequences, based on the definition of infinite Poisson generic sequences. We conjecture that codewords in the dual Melas code satisfy this postulate, and we show partial progress in establishing this conjecture. We also show how a relaxed version of the problem can be completely resolved, and relate the conjecture to the first part of the paper, giving a justification of why the improved bounds on the b-symbol weight were somewhat to be expected.
ER  -

Abstract

Related

Cite