Computer-aided constructions of commafree codes

DOI10.1007/S10817-023-09662-6MaRDI QIDQ6156641zbMATH OpenOpenAlexFDO

Authors Aaron A. Windsor

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

zbMATH Keywords

bounded variable additioncoding theorycommafree codesSAT solver

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Recommendations

• A family of comma-free codes with even word-length
• A New Result on Comma-Free Codes of Even Word-Length
• The Construction of Variable-length Comma-Free Codes
• scientific article; zbMATH DE number 7731171
• Some properties of maximal comma-free codes

Cites work

• A Computing Procedure for Quantification Theory
• Comma-Free Codes
• Computer-aided proof of Erdős discrepancy properties
• Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers
• scientific article; zbMATH DE number 5139161 (Why is no real title available?)
• On maximal comma-free codes (Corresp.)
• On the construction of comma-free codes
• Regent Results in Comma-Free Codes
• Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
• The van der Waerden NumberW(2, 6) Is 1132

Cited in

(3)

• Restrictions and generalizations on comma-free codes
• scientific article; zbMATH DE number 3891253 (Why is no real title available?)
• QPlus: computer package for coding theory research and education

This page was built for publication: Computer-aided constructions of commafree codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6156641)