2015
DOI: 10.1186/s13638-015-0334-1
|View full text |Cite
|
Sign up to set email alerts
|

Jointly optimized multiple Reed-Muller codes for wireless half-duplex coded-cooperative network with joint decoding

Abstract: In this paper, we present a novel technique to use Reed-Muller (RM) codes for the wireless half-duplex coded-cooperative network. Plotkin's construction allows RM codes to be used in a coded-cooperative scheme. To improve the cooperation provided by the relay in a coded-cooperative scheme, a design criterion and an efficient algorithm to achieve the design objective are also suggested. Moreover, union bounds for average error probability are determined, for both the cooperative and the non-cooperative schemes … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
40
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 15 publications
(40 citation statements)
references
References 38 publications
0
40
0
Order By: Relevance
“…Store it in set Q. Now Q = 1 therefore, the optimum combination λ 0 = λ p = [1,3,4,5,6,7,9,10,11,13,15] corresponds to the least α 2 , i.e. 38, is selected and algorithm-1 is terminated at this stage.…”
Section: Examplementioning
confidence: 99%
See 4 more Smart Citations
“…Store it in set Q. Now Q = 1 therefore, the optimum combination λ 0 = λ p = [1,3,4,5,6,7,9,10,11,13,15] corresponds to the least α 2 , i.e. 38, is selected and algorithm-1 is terminated at this stage.…”
Section: Examplementioning
confidence: 99%
“…The unique combination of ωg that yielded the lowest β 2 is 60 as shown in Table 2. This obtained unique combination is saved in set V. Now V = 1, therefore, the optimum combination ω 0 = ωg = 4, 6,7,9,11,12,13,15,17,19,20,21,22,23,24, 26 corresponds to minimum β 2 , i.e. 60, is selected and algorithm-2 is terminated at this stage.…”
Section: Examplementioning
confidence: 99%
See 3 more Smart Citations