Abstract
Suppose that L is a nonempty language over A, k. N0 and m. N. If L satisfies ( LAk)m L n A+ (LAk)m-1LA+ = O, then L is a code and is called a (k, m)-c......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
