Name
Abstract | ||
|---|---|---|
We introduce the concepts "maximal error-correcting capability" and "maximal error-detecting capability" of a given formal language (set of words), with respect to a certain class of combinatorial channels. A combinatorial channel is a set of pairs of words describing all the possible input/output channel situations. This paper is mainly intended to obtain basic general results on these new concepts and discuss possible research directions with an emphasis on the problem of computing maximal error-detecting (or-correcting) capabilities of a given regular language. |
Year | Venue | Keywords |
|---|---|---|
2008 | ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers | maximal error-detecting,possible input,maximal error-correcting capability,error-detection,combinatorial channel,formal language,er- ror model,algorithm,regular language,automaton,possible research direction,maximal error-detecting capability,basic general result,maximal,output channel situation,channel,error-correction,error detection,error correction |
DocType | Volume | Issue |
Journal | 13 | 1 |
ISBN | Citations | PageRank |
960-8457-47-5 | 0 | 0.34 |
References | Authors | |
1 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stavros Konstantinidis | 1 | 283 | 31.10 |
| Pedro V. Silva | 2 | 141 | 29.42 |