Estimating the size of correcting codes using extremal graph problems

DOI10.1007/978-0-387-98096-6_12MaRDI QIDQ3407619zbMATH OpenOpenAlexFDO

Authors P. I. Stetsyuk, Sergiy Butenko, Panos M. Pardalos, I. V. Sergienko, V. P. Shylo

Publication date 4 March 2010

Published in Springer Optimization and Its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-0-387-98096-6_12

zbMATH Keywords

combinatorial optimizationgraph coloringmaximum independent setcoding theoryerror-correcting codes

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Synchronization error-correcting codes (94B50)

Recommendations

• scientific article; zbMATH DE number 6497233
• Error-correcting codes from graphs
• On an isoperimetric problem for Hamming graphs
• scientific article; zbMATH DE number 1996483
• Publication:4886131

Cited in

(6)

• Generating (2,3)-codes
• Flips in graphs
• On the maximal independence polynomial of the covering graph of the hypercube up to \(n=6\)
• The packing number of the double vertex graph of the path graph
• On the power of simple reductions for the maximum independent set problem
• Clique-detection models in computational biochemistry and genomics

Describes a project that uses

Uses Software

• DIMACS

This page was built for publication: Estimating the size of correcting codes using extremal graph problems

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