AI & ML
A new class of optimal binary linear complementary pairs of codes
arXiv math.IT0 views
arXiv:2611.03733v1 Announce Type: new Abstract: The construction of optimal binary linear complementary pair (LCP) has recently attracted considerable attention in coding theory. Based on the Belov codes, this paper proposes a novel construction of optimal binary LCPs with $\theta=4$, extending our previous work on $\theta=3$. Our results not only yield abundant new optimal binary LCPs with flexible parameters, but also enable more optimal binary LCPs with smaller minimum distances.
Source:https://arxiv.org/abs/2611.03733PreviousUse NVIDIA NeMo to Turn Agent Failures into Tests and Harness FixesNextTimely Ground-Station Status Delivery via UAV-Assisted Data Collection and Hierarchical RL
Related posts
GPT-5 Resmi Dirilis: Ancaman atau Peluang Baru bagi Data Scientist?
0dev.to DevOps

Data center shares fall as investors expect slower AI buildout after Democrats win Congress; Hut 8 drops 23%, IREN 11%, Core Scientific 10%, Applied Digital 7% (Reuters)
0Techmeme

Sources: Google DeepMind spinout Isomorphic Labs is in talks to raise ~$5B at a ~$50B valuation; the AI drug discovery startup last raised $2.1B in May (Bloomberg)
0Techmeme

OpenAI launches Images 2.6 in ChatGPT, Codex, and the API, saying it generates images 50% faster, and adds animated GIF creation from prompts or photos (Emma Roth/The Verge)
0Techmeme

Sources: Anthropic and AP struck a licensing deal just before the midterms, marking the first time Anthropic paid a digital news publisher to license content (Mark Stenberg/Adweek)
0Techmeme

Sources: Goldman Sachs and Apollo are in talks with investors to sell portions of SpaceX's ~$40B chip financing, asking some for up to $500M before syndication (Carmen Arroyo/Bloomberg)
0Techmeme