Decidability of multiset, set and numerically decipherable directed figure codes

MaRDI QIDQ4558954zbMATH OpenFDO

Authors Włodzimierz Moczurad

Publication date 30 November 2018

Full work available at URL https://arxiv.org/abs/1604.02167, https://dmtcs.episciences.org/3301/pdf

zbMATH Keywords

decipherability verificationdirected figuresmultiset decipherable codesuniquely decipherable codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• Multiset, Set and Numerically Decipherable Codes over Directed Figures
• Directed figure codes: decidability frontier
• Directed figure codes: decidability frontier
• The code problem for directed figures
• scientific article; zbMATH DE number 5761821

Cited in

(13)

• Decipherability of codes
• Two-dimensional codes
• Full sets of pictures to encode pictures
• Domino graphs and the decipherability of directed figure codes
• Multiset, Set and Numerically Decipherable Codes over Directed Figures
• The code problem for directed figures
• Directed figure codes: decidability frontier
• scientific article; zbMATH DE number 5761821 (Why is no real title available?)
• Directed figure codes: decidability frontier
• On multiset decipherable codes (Corresp.)
• Decidability of involution hypercodes
• Deciding multiset decipherability
• Multiset and set decipherable codes

This page was built for publication: Decidability of multiset, set and numerically decipherable directed figure codes

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