scientific article; zbMATH DE number 16254
From MaRDI portal
Publication:3972907
[For the entire collection see Zbl 0715.00010.] Starting with the basic facts on error-detecting and error-correcting codes this chapter pursues codes based on latin squares. Codes based on orthogonal latin squares and their generalizations and row and column complete latin squares are surveyed. Next two-dimensional coding problems are explored. There is a good introduction to the use of latin squares in the construction of secret-sharing schemes for security. The chapter closes with future references.
Recommendations
Cited in
(14)- A note on check character systems using Latin squares
- A new authentication scheme based on latin squares
- An algorithm for the planar three-index assignment problem
- A decoding algorithm for orthogonal Latin square codes
- Equivalence classes of Latin squares and nets in \(\mathbb{CP}^{2}\)
- Primitive Pythagorean codes
- Another generalized Golomb-Posner code
- scientific article; zbMATH DE number 1455120 (Why is no real title available?)
- scientific article; zbMATH DE number 1496422 (Why is no real title available?)
- scientific article; zbMATH DE number 1890839 (Why is no real title available?)
- Substructures in Latin squares
- Embedding in MDS codes and Latin cubes
- Constructions of pairs of orthogonal latin cubes
- Characterization of polynomially complete quasigroups based on Latin squares for cryptographic transformations.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3972907)
