Evolving Towards Better Codes: LLM-Guided Search for High-Distance Binary Linear Codes
cs.IT, cs.AI, cs.NE, math.IT
Submitted: 2026-09-29
Updated: 2026-09-29
Sources
- PatternBoost: Constructions in Mathematics with a Little Help from AI
- Mutation Without Variation: Convergence Dynamics in LLM-Driven Program Evolution
- Automated Design of Agentic Systems
- Evolution through Large Models
- ShinkaEvolve: Towards Open-Ended And Sample-Efficient Program Evolution
- The AI Scientist: Towards Fully Automated Open-Ended Scientific Discovery
- Illuminating search spaces by mapping elites
- Language Model Crossover: Variation through Few-Shot Prompting
- AlphaEvolve: A coding agent for scientific and algorithmic discovery
- Constructions in combinatorics via neural networks
- LLM-Guided Search for Deletion-Correcting Codes
- Evolutionary Computation in the Era of Large Language Model: Survey and Roadmap
- New record-breaking binary linear codes constructed from group codes
Related papers
- Language Modeling is Monotone Compression
- Clipped Affine Policy: Low-Complexity Near-Optimal Online Power Control for Energy Harvesting Communications over Fading Channels
- Discrepancy for Random Linear Codes
- A New Approach to Code Smoothing Bounds
- Contextual Memory-Enhanced Source Coding for Low-SNR Communications
- Symmetry-Enforced Quadratic Approximate-Degradability Bounds for Noisy Landau-Streater Channels