Computer-aided constructions of commafree codes
From MaRDI portal
Publication:6156641
DOI10.1007/s10817-023-09662-6OpenAlexW4321224163MaRDI QIDQ6156641
Publication date: 14 June 2023
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-023-09662-6
Cites Work
- Unnamed Item
- Computer-aided proof of Erdős discrepancy properties
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
- Comma-Free Codes
- The van der Waerden NumberW(2, 6) Is 1132
- Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers
- Regent Results in Comma-Free Codes
- On the construction of comma-free codes
- A Computing Procedure for Quantification Theory
- On maximal comma-free codes (Corresp.)
This page was built for publication: Computer-aided constructions of commafree codes