1988
DOI: 10.1049/el:19880855
|View full text |Cite
|
Sign up to set email alerts
|

Construction of t -EC/AUED codes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

1992
1992
2015
2015

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 4 publications
0
4
0
Order By: Relevance
“…By using the proposed method, we have shown that we can d u c e the encoding/decoding table to about l / m in size compared with the conventional methods proposed in [31 and [4]. Moreover, we have proposed several algorithms to construct B,(b, t) and thereby obtained superior Bo(b, t) and Bi(b, t) than Values without mark are.…”
Section: Resultsmentioning
confidence: 94%
See 3 more Smart Citations
“…By using the proposed method, we have shown that we can d u c e the encoding/decoding table to about l / m in size compared with the conventional methods proposed in [31 and [4]. Moreover, we have proposed several algorithms to construct B,(b, t) and thereby obtained superior Bo(b, t) and Bi(b, t) than Values without mark are.…”
Section: Resultsmentioning
confidence: 94%
“…(1) Theorem 2 Code C is a t-EUAUED code ifand only i f for any distinct codewords X, Y E C, (2) The most representative t-ECIAUED codes proposed so far are considered to be the ones due to [3] and [4], which we shall referred to as code CO and Ci, respectively. The t-EUAUED code CO proposedin [3], which is constructed based on an (n, k, 2t + 1) code D, is given by N(X,Y) 2 t + 1 andN(Y,X) 2 t + 1.…”
Section: Preliminariesmentioning
confidence: 99%
See 2 more Smart Citations