\(k\)-p-infix codes and semaphore codes
From MaRDI portal
Publication:5931791
DOI10.1016/S0166-218X(00)00260-2zbMath0976.68120MaRDI QIDQ5931791
Duanning Zhou, Jian Ma, Wei-Jia Jia, Dong Yang Long
Publication date: 6 May 2001
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
\(k\)-p-infix codes\(n\)-\(k\)-infix-outfix codes\(n\)-\(k\)-prefix-suffix languages\(n\)-\(k\)-ps-infix languages
Related Items
Codes defined by multiple sets of trajectories ⋮ \(n\)-PS-codes, 2-infix-outfix codes and some related classes of codes
Cites Work
- On group codes
- Languages whose \(n\)-element subsets are codes
- Outfix and infix codes and related classes of languages
- On the structure of some group codes
- Structure of 3-infix-outfix maximal codes.
- Anti-commutative languages and n-codes
- Shuffle Relations and Codes
- n-Prefix–suffix languages∗
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
