Research map / Learning theory and algorithms / Combinatorial and search optimization
Using Constraint Solvers to Construct Binary Codes with Good Error Correction Performance
Stepan Kochemazov, Oleg Zaikin, Grigorii Trofimiuk, Kirill Antonov, Alexander Semenov
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use constraint solvers instead of Magma/Qext database codes | code search · (40, 8, 16) | error coefficient T: 32 -> 1 | Improved |
| use constraint solvers instead of Magma/Qext | code search · (35, 10, 12) | error coefficient T: 53 -> 7 | Improved |
| use constraint solvers instead of Magma | code search · (47, 12, 16) | error coefficient T: 469 -> 36 | Improved |
| lower T found by solvers | code search · (40, 8, 16) | SNR gain over Qext (dB): 0.25 dB | Improved |
| restrict weight-d codewords to blocks R={4,5} with Kissat (ablation) | Kissat · (35, 10, 12) | error coefficient T: 15 -> 14 | Improved |
| add blocks restriction with CP-SAT (ablation) | CP-SAT · (35, 10, 12) | error coefficient T | No clear effect |
| add symmetry breaking (ablation) | SAT/MaxSAT/CP-SAT · 51 (n,k,d) triples | codes found / T | Mixed |
| use parallel solvers on blocks R={4,5} | Painless / CnC vs sequential Kissat · (35, 10, 12) | error coefficient T: 14 -> 7 | Improved |
| use parallel solvers instead of sequential | parallel SAT · (47, 12, 16) | error coefficient T: 48 -> 50 | No clear effect |
| lower error coefficient T | code design · (40, 8, 16) | FER | Mixed |
Closest papers by meaning
- The Impact of Literal Sorting on Cardinality Constraint Encodings (AAAI 2025 · similarity 0.81)
- Learning Linear Block Error Correction Codes (ICML 2024 · similarity 0.81)
- Encoding Constraints as Binary Constraint Networks Satisfying BTP (AAAI 2024 · similarity 0.80)
- Certifying Bounds Propagation for Integer Multiplication Constraints (AAAI 2025 · similarity 0.80)
- A SAT + Computer Algebra System Verification of the Ramsey Problem R(3, 8) (Student Abstract) (AAAI 2024 · similarity 0.80)
- Improving the Lower Bound in Branch-and-Bound Algorithms for MaxSAT (AAAI 2025 · similarity 0.79)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
