Structure and measure of a decidable class of two-dimensional codes
From MaRDI portal
Recommendations
- Infinite two-dimensional strong prefix codes: characterization and properties
- Prefix picture codes: a decidable class of two-dimensional codes
- Characterization and measure of infinite two-dimensional strong prefix codes
- Two dimensional prefix codes of pictures
- Structure and properties of strong prefix codes of pictures
Cited in
(10)- Infinite two-dimensional strong prefix codes: characterization and properties
- A 2D non-overlapping code over a q-ary alphabet
- Characterization and measure of infinite two-dimensional strong prefix codes
- Full sets of pictures to encode pictures
- Prefix picture codes: a decidable class of two-dimensional codes
- Two dimensional prefix codes of pictures
- Picture codes with finite deciphering delay
- Planar Convex Codes are Decidable
- Two-dimensional comma-free and cylindric codes
- Non-overlapping matrices
This page was built for publication: Structure and measure of a decidable class of two-dimensional codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2799183)