A generalization of Sardinas and Patterson's algorithm to \(Z\)-codes (Q1208716)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A generalization of Sardinas and Patterson's algorithm to \(Z\)-codes |
scientific article; zbMATH DE number 166964
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A generalization of Sardinas and Patterson's algorithm to \(Z\)-codes |
scientific article; zbMATH DE number 166964 |
Statements
A generalization of Sardinas and Patterson's algorithm to \(Z\)-codes (English)
0 references
16 May 1993
0 references
algorithms on \(Z\)-codes
0 references
\(Z\)-deciphering delay
0 references
upper bound
0 references
double \(Z\)- factorization
0 references
