Quadratic algorithms for testing of codes and \(\diamond\)-codes (Q5416735)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6295290
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Quadratic algorithms for testing of codes and \(\diamond\)-codes |
scientific article; zbMATH DE number 6295290 |
Statements
Quadratic Algorithms for Testing of Codes and ◊-Codes (English)
0 references
14 May 2014
0 references
code
0 references
unique decipherability problem
0 references
regular set
0 references
recognizable subset
0 references
syntactic monoid
0 references
Sardinas-Patterson test
0 references
quadratic algorithm
0 references
Rees matrix semigroups
0 references
0.7902488708496094
0 references
0.7897558808326721
0 references
0.7864838242530823
0 references
0.766413688659668
0 references
0.7659575343132019
0 references
