Optimized Distributed Generalized Reed-Solomon Coding with Space-Time Block Coded Spatial Modulation

We present a well-known generalized Reed–Solomon (GRS) code incorporated with space-time block coded spatial modulation (STBC-SM) for wireless networks, which is capable of enjoying coded cooperation between the source and the relay. In the proposed distributed GRS-coded STBC-SM (DGRSC-STBC-SM) sche...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Chunli Zhao [verfasserIn] Fengfan Yang [verfasserIn] Daniel Kariuki Waweru [verfasserIn] Chen Chen [verfasserIn] Hongjun Xu [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2022

Schlagwörter:	generalized Reed–Solomon (GRS) coded cooperation space-time block coded spatial modulation (STBC-SM)

Übergeordnetes Werk:	In: Sensors - MDPI AG, 2003, 22(2022), 16, p 6305
Übergeordnetes Werk:	volume:22 ; year:2022 ; number:16, p 6305

Links:	Link aufrufen Link aufrufen Link aufrufen Journal toc

DOI / URN:	10.3390/s22166305

Katalog-ID:	DOAJ079214851

Internformat


LEADER	01000caa a22002652 4500
001	DOAJ079214851
003	DE-627
005	20240414072659.0
007	cr uuu---uuuuu
008	230307s2022 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.3390/s22166305 \|2 doi
035			\|a (DE-627)DOAJ079214851
035			\|a (DE-599)DOAJb183e2481f4741b293c6c18a28cf2f96
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
050		0	\|a TP1-1185
100	0		\|a Chunli Zhao \|e verfasserin \|4 aut
245	1	0	\|a Optimized Distributed Generalized Reed-Solomon Coding with Space-Time Block Coded Spatial Modulation
264		1	\|c 2022
336			\|a Text \|b txt \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
520			\|a We present a well-known generalized Reed–Solomon (GRS) code incorporated with space-time block coded spatial modulation (STBC-SM) for wireless networks, which is capable of enjoying coded cooperation between the source and the relay. In the proposed distributed GRS-coded STBC-SM (DGRSC-STBC-SM) scheme, the source and relay nodes use distinct GRS codes. At the relay, we employ the concept of information selection to choose the message symbols from the source for further encoding. Thus, the codewords jointly constructed by the source and relay are generated at the destination. For achieving the best codeword set at the destination, we propose an optimal algorithm at the relay to select partial symbols from the source. To reduce the computational complexity, we propose a more practical algorithm with low complexity. Monte Carlo simulation results show that the proposed scheme using the low-complexity algorithm can achieve near-optimal error performance. Furthermore, our proposed scheme provides better error performance than its corresponding coded non-cooperative counterpart and the existing Reed–Solomon coded cooperative SM (RSCC-SM) scheme under identical conditions.
650		4	\|a generalized Reed–Solomon (GRS)
650		4	\|a coded cooperation
650		4	\|a space-time block coded spatial modulation (STBC-SM)
653		0	\|a Chemical technology
700	0		\|a Fengfan Yang \|e verfasserin \|4 aut
700	0		\|a Daniel Kariuki Waweru \|e verfasserin \|4 aut
700	0		\|a Chen Chen \|e verfasserin \|4 aut
700	0		\|a Hongjun Xu \|e verfasserin \|4 aut
773	0	8	\|i In \|t Sensors \|d MDPI AG, 2003 \|g 22(2022), 16, p 6305 \|w (DE-627)331640910 \|w (DE-600)2052857-7 \|x 14248220 \|7 nnns
773	1	8	\|g volume:22 \|g year:2022 \|g number:16, p 6305
856	4	0	\|u https://doi.org/10.3390/s22166305 \|z kostenfrei
856	4	0	\|u https://doaj.org/article/b183e2481f4741b293c6c18a28cf2f96 \|z kostenfrei
856	4	0	\|u https://www.mdpi.com/1424-8220/22/16/6305 \|z kostenfrei
856	4	2	\|u https://doaj.org/toc/1424-8220 \|y Journal toc \|z kostenfrei
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_DOAJ
912			\|a GBV_ILN_20
912			\|a GBV_ILN_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_24
912			\|a GBV_ILN_31
912			\|a GBV_ILN_39
912			\|a GBV_ILN_40
912			\|a GBV_ILN_60
912			\|a GBV_ILN_62
912			\|a GBV_ILN_63
912			\|a GBV_ILN_65
912			\|a GBV_ILN_69
912			\|a GBV_ILN_70
912			\|a GBV_ILN_73
912			\|a GBV_ILN_95
912			\|a GBV_ILN_105
912			\|a GBV_ILN_110
912			\|a GBV_ILN_151
912			\|a GBV_ILN_161
912			\|a GBV_ILN_170
912			\|a GBV_ILN_206
912			\|a GBV_ILN_213
912			\|a GBV_ILN_230
912			\|a GBV_ILN_285
912			\|a GBV_ILN_293
912			\|a GBV_ILN_370
912			\|a GBV_ILN_602
912			\|a GBV_ILN_2005
912			\|a GBV_ILN_2009
912			\|a GBV_ILN_2011
912			\|a GBV_ILN_2014
912			\|a GBV_ILN_2055
912			\|a GBV_ILN_2057
912			\|a GBV_ILN_2111
912			\|a GBV_ILN_2507
912			\|a GBV_ILN_4012
912			\|a GBV_ILN_4037
912			\|a GBV_ILN_4112
912			\|a GBV_ILN_4125
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4249
912			\|a GBV_ILN_4305
912			\|a GBV_ILN_4306
912			\|a GBV_ILN_4307
912			\|a GBV_ILN_4313
912			\|a GBV_ILN_4322
912			\|a GBV_ILN_4323
912			\|a GBV_ILN_4324
912			\|a GBV_ILN_4325
912			\|a GBV_ILN_4335
912			\|a GBV_ILN_4338
912			\|a GBV_ILN_4367
912			\|a GBV_ILN_4700
951			\|a AR
952			\|d 22 \|j 2022 \|e 16, p 6305

Indexfelder

author_variant	c z cz f y fy d k w dkw c c cc h x hx
matchkey_str	article:14248220:2022----::piiedsrbtdeeaiereslmnoigihpctmbok
hierarchy_sort_str	2022
callnumber-subject-code	TP
publishDate	2022
allfields	10.3390/s22166305 doi (DE-627)DOAJ079214851 (DE-599)DOAJb183e2481f4741b293c6c18a28cf2f96 DE-627 ger DE-627 rakwb eng TP1-1185 Chunli Zhao verfasserin aut Optimized Distributed Generalized Reed-Solomon Coding with Space-Time Block Coded Spatial Modulation 2022 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier We present a well-known generalized Reed–Solomon (GRS) code incorporated with space-time block coded spatial modulation (STBC-SM) for wireless networks, which is capable of enjoying coded cooperation between the source and the relay. In the proposed distributed GRS-coded STBC-SM (DGRSC-STBC-SM) scheme, the source and relay nodes use distinct GRS codes. At the relay, we employ the concept of information selection to choose the message symbols from the source for further encoding. Thus, the codewords jointly constructed by the source and relay are generated at the destination. For achieving the best codeword set at the destination, we propose an optimal algorithm at the relay to select partial symbols from the source. To reduce the computational complexity, we propose a more practical algorithm with low complexity. Monte Carlo simulation results show that the proposed scheme using the low-complexity algorithm can achieve near-optimal error performance. Furthermore, our proposed scheme provides better error performance than its corresponding coded non-cooperative counterpart and the existing Reed–Solomon coded cooperative SM (RSCC-SM) scheme under identical conditions. generalized Reed–Solomon (GRS) coded cooperation space-time block coded spatial modulation (STBC-SM) Chemical technology Fengfan Yang verfasserin aut Daniel Kariuki Waweru verfasserin aut Chen Chen verfasserin aut Hongjun Xu verfasserin aut In Sensors MDPI AG, 2003 22(2022), 16, p 6305 (DE-627)331640910 (DE-600)2052857-7 14248220 nnns volume:22 year:2022 number:16, p 6305 https://doi.org/10.3390/s22166305 kostenfrei https://doaj.org/article/b183e2481f4741b293c6c18a28cf2f96 kostenfrei https://www.mdpi.com/1424-8220/22/16/6305 kostenfrei https://doaj.org/toc/1424-8220 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2005 GBV_ILN_2009 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2055 GBV_ILN_2057 GBV_ILN_2111 GBV_ILN_2507 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 22 2022 16, p 6305
spelling	10.3390/s22166305 doi (DE-627)DOAJ079214851 (DE-599)DOAJb183e2481f4741b293c6c18a28cf2f96 DE-627 ger DE-627 rakwb eng TP1-1185 Chunli Zhao verfasserin aut Optimized Distributed Generalized Reed-Solomon Coding with Space-Time Block Coded Spatial Modulation 2022 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier We present a well-known generalized Reed–Solomon (GRS) code incorporated with space-time block coded spatial modulation (STBC-SM) for wireless networks, which is capable of enjoying coded cooperation between the source and the relay. In the proposed distributed GRS-coded STBC-SM (DGRSC-STBC-SM) scheme, the source and relay nodes use distinct GRS codes. At the relay, we employ the concept of information selection to choose the message symbols from the source for further encoding. Thus, the codewords jointly constructed by the source and relay are generated at the destination. For achieving the best codeword set at the destination, we propose an optimal algorithm at the relay to select partial symbols from the source. To reduce the computational complexity, we propose a more practical algorithm with low complexity. Monte Carlo simulation results show that the proposed scheme using the low-complexity algorithm can achieve near-optimal error performance. Furthermore, our proposed scheme provides better error performance than its corresponding coded non-cooperative counterpart and the existing Reed–Solomon coded cooperative SM (RSCC-SM) scheme under identical conditions. generalized Reed–Solomon (GRS) coded cooperation space-time block coded spatial modulation (STBC-SM) Chemical technology Fengfan Yang verfasserin aut Daniel Kariuki Waweru verfasserin aut Chen Chen verfasserin aut Hongjun Xu verfasserin aut In Sensors MDPI AG, 2003 22(2022), 16, p 6305 (DE-627)331640910 (DE-600)2052857-7 14248220 nnns volume:22 year:2022 number:16, p 6305 https://doi.org/10.3390/s22166305 kostenfrei https://doaj.org/article/b183e2481f4741b293c6c18a28cf2f96 kostenfrei https://www.mdpi.com/1424-8220/22/16/6305 kostenfrei https://doaj.org/toc/1424-8220 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2005 GBV_ILN_2009 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2055 GBV_ILN_2057 GBV_ILN_2111 GBV_ILN_2507 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 22 2022 16, p 6305
allfields_unstemmed	10.3390/s22166305 doi (DE-627)DOAJ079214851 (DE-599)DOAJb183e2481f4741b293c6c18a28cf2f96 DE-627 ger DE-627 rakwb eng TP1-1185 Chunli Zhao verfasserin aut Optimized Distributed Generalized Reed-Solomon Coding with Space-Time Block Coded Spatial Modulation 2022 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier We present a well-known generalized Reed–Solomon (GRS) code incorporated with space-time block coded spatial modulation (STBC-SM) for wireless networks, which is capable of enjoying coded cooperation between the source and the relay. In the proposed distributed GRS-coded STBC-SM (DGRSC-STBC-SM) scheme, the source and relay nodes use distinct GRS codes. At the relay, we employ the concept of information selection to choose the message symbols from the source for further encoding. Thus, the codewords jointly constructed by the source and relay are generated at the destination. For achieving the best codeword set at the destination, we propose an optimal algorithm at the relay to select partial symbols from the source. To reduce the computational complexity, we propose a more practical algorithm with low complexity. Monte Carlo simulation results show that the proposed scheme using the low-complexity algorithm can achieve near-optimal error performance. Furthermore, our proposed scheme provides better error performance than its corresponding coded non-cooperative counterpart and the existing Reed–Solomon coded cooperative SM (RSCC-SM) scheme under identical conditions. generalized Reed–Solomon (GRS) coded cooperation space-time block coded spatial modulation (STBC-SM) Chemical technology Fengfan Yang verfasserin aut Daniel Kariuki Waweru verfasserin aut Chen Chen verfasserin aut Hongjun Xu verfasserin aut In Sensors MDPI AG, 2003 22(2022), 16, p 6305 (DE-627)331640910 (DE-600)2052857-7 14248220 nnns volume:22 year:2022 number:16, p 6305 https://doi.org/10.3390/s22166305 kostenfrei https://doaj.org/article/b183e2481f4741b293c6c18a28cf2f96 kostenfrei https://www.mdpi.com/1424-8220/22/16/6305 kostenfrei https://doaj.org/toc/1424-8220 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2005 GBV_ILN_2009 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2055 GBV_ILN_2057 GBV_ILN_2111 GBV_ILN_2507 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 22 2022 16, p 6305
allfieldsGer	10.3390/s22166305 doi (DE-627)DOAJ079214851 (DE-599)DOAJb183e2481f4741b293c6c18a28cf2f96 DE-627 ger DE-627 rakwb eng TP1-1185 Chunli Zhao verfasserin aut Optimized Distributed Generalized Reed-Solomon Coding with Space-Time Block Coded Spatial Modulation 2022 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier We present a well-known generalized Reed–Solomon (GRS) code incorporated with space-time block coded spatial modulation (STBC-SM) for wireless networks, which is capable of enjoying coded cooperation between the source and the relay. In the proposed distributed GRS-coded STBC-SM (DGRSC-STBC-SM) scheme, the source and relay nodes use distinct GRS codes. At the relay, we employ the concept of information selection to choose the message symbols from the source for further encoding. Thus, the codewords jointly constructed by the source and relay are generated at the destination. For achieving the best codeword set at the destination, we propose an optimal algorithm at the relay to select partial symbols from the source. To reduce the computational complexity, we propose a more practical algorithm with low complexity. Monte Carlo simulation results show that the proposed scheme using the low-complexity algorithm can achieve near-optimal error performance. Furthermore, our proposed scheme provides better error performance than its corresponding coded non-cooperative counterpart and the existing Reed–Solomon coded cooperative SM (RSCC-SM) scheme under identical conditions. generalized Reed–Solomon (GRS) coded cooperation space-time block coded spatial modulation (STBC-SM) Chemical technology Fengfan Yang verfasserin aut Daniel Kariuki Waweru verfasserin aut Chen Chen verfasserin aut Hongjun Xu verfasserin aut In Sensors MDPI AG, 2003 22(2022), 16, p 6305 (DE-627)331640910 (DE-600)2052857-7 14248220 nnns volume:22 year:2022 number:16, p 6305 https://doi.org/10.3390/s22166305 kostenfrei https://doaj.org/article/b183e2481f4741b293c6c18a28cf2f96 kostenfrei https://www.mdpi.com/1424-8220/22/16/6305 kostenfrei https://doaj.org/toc/1424-8220 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2005 GBV_ILN_2009 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2055 GBV_ILN_2057 GBV_ILN_2111 GBV_ILN_2507 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 22 2022 16, p 6305
allfieldsSound	10.3390/s22166305 doi (DE-627)DOAJ079214851 (DE-599)DOAJb183e2481f4741b293c6c18a28cf2f96 DE-627 ger DE-627 rakwb eng TP1-1185 Chunli Zhao verfasserin aut Optimized Distributed Generalized Reed-Solomon Coding with Space-Time Block Coded Spatial Modulation 2022 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier We present a well-known generalized Reed–Solomon (GRS) code incorporated with space-time block coded spatial modulation (STBC-SM) for wireless networks, which is capable of enjoying coded cooperation between the source and the relay. In the proposed distributed GRS-coded STBC-SM (DGRSC-STBC-SM) scheme, the source and relay nodes use distinct GRS codes. At the relay, we employ the concept of information selection to choose the message symbols from the source for further encoding. Thus, the codewords jointly constructed by the source and relay are generated at the destination. For achieving the best codeword set at the destination, we propose an optimal algorithm at the relay to select partial symbols from the source. To reduce the computational complexity, we propose a more practical algorithm with low complexity. Monte Carlo simulation results show that the proposed scheme using the low-complexity algorithm can achieve near-optimal error performance. Furthermore, our proposed scheme provides better error performance than its corresponding coded non-cooperative counterpart and the existing Reed–Solomon coded cooperative SM (RSCC-SM) scheme under identical conditions. generalized Reed–Solomon (GRS) coded cooperation space-time block coded spatial modulation (STBC-SM) Chemical technology Fengfan Yang verfasserin aut Daniel Kariuki Waweru verfasserin aut Chen Chen verfasserin aut Hongjun Xu verfasserin aut In Sensors MDPI AG, 2003 22(2022), 16, p 6305 (DE-627)331640910 (DE-600)2052857-7 14248220 nnns volume:22 year:2022 number:16, p 6305 https://doi.org/10.3390/s22166305 kostenfrei https://doaj.org/article/b183e2481f4741b293c6c18a28cf2f96 kostenfrei https://www.mdpi.com/1424-8220/22/16/6305 kostenfrei https://doaj.org/toc/1424-8220 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2005 GBV_ILN_2009 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2055 GBV_ILN_2057 GBV_ILN_2111 GBV_ILN_2507 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 22 2022 16, p 6305
language	English
source	In Sensors 22(2022), 16, p 6305 volume:22 year:2022 number:16, p 6305
sourceStr	In Sensors 22(2022), 16, p 6305 volume:22 year:2022 number:16, p 6305
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	generalized Reed–Solomon (GRS) coded cooperation space-time block coded spatial modulation (STBC-SM) Chemical technology
isfreeaccess_bool	true
container_title	Sensors
authorswithroles_txt_mv	Chunli Zhao @@aut@@ Fengfan Yang @@aut@@ Daniel Kariuki Waweru @@aut@@ Chen Chen @@aut@@ Hongjun Xu @@aut@@
publishDateDaySort_date	2022-01-01T00:00:00Z
hierarchy_top_id	331640910
id	DOAJ079214851
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ079214851</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240414072659.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230307s2022 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.3390/s22166305</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ079214851</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJb183e2481f4741b293c6c18a28cf2f96</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TP1-1185</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Chunli Zhao</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Optimized Distributed Generalized Reed-Solomon Coding with Space-Time Block Coded Spatial Modulation</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2022</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">We present a well-known generalized Reed–Solomon (GRS) code incorporated with space-time block coded spatial modulation (STBC-SM) for wireless networks, which is capable of enjoying coded cooperation between the source and the relay. In the proposed distributed GRS-coded STBC-SM (DGRSC-STBC-SM) scheme, the source and relay nodes use distinct GRS codes. At the relay, we employ the concept of information selection to choose the message symbols from the source for further encoding. Thus, the codewords jointly constructed by the source and relay are generated at the destination. For achieving the best codeword set at the destination, we propose an optimal algorithm at the relay to select partial symbols from the source. To reduce the computational complexity, we propose a more practical algorithm with low complexity. Monte Carlo simulation results show that the proposed scheme using the low-complexity algorithm can achieve near-optimal error performance. Furthermore, our proposed scheme provides better error performance than its corresponding coded non-cooperative counterpart and the existing Reed–Solomon coded cooperative SM (RSCC-SM) scheme under identical conditions.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">generalized Reed–Solomon (GRS)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">coded cooperation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">space-time block coded spatial modulation (STBC-SM)</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Chemical technology</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Fengfan Yang</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Daniel Kariuki Waweru</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Chen Chen</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Hongjun Xu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Sensors</subfield><subfield code="d">MDPI AG, 2003</subfield><subfield code="g">22(2022), 16, p 6305</subfield><subfield code="w">(DE-627)331640910</subfield><subfield code="w">(DE-600)2052857-7</subfield><subfield code="x">14248220</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:22</subfield><subfield code="g">year:2022</subfield><subfield code="g">number:16, p 6305</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.3390/s22166305</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/b183e2481f4741b293c6c18a28cf2f96</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.mdpi.com/1424-8220/22/16/6305</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/1424-8220</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_206</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2057</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">22</subfield><subfield code="j">2022</subfield><subfield code="e">16, p 6305</subfield></datafield></record></collection>
callnumber-first	T - Technology
author	Chunli Zhao
spellingShingle	Chunli Zhao misc TP1-1185 misc generalized Reed–Solomon (GRS) misc coded cooperation misc space-time block coded spatial modulation (STBC-SM) misc Chemical technology Optimized Distributed Generalized Reed-Solomon Coding with Space-Time Block Coded Spatial Modulation
authorStr	Chunli Zhao
ppnlink_with_tag_str_mv	@@773@@(DE-627)331640910
format	electronic Article
delete_txt_mv	keep
author_role	aut aut aut aut aut
collection	DOAJ
remote_str	true
callnumber-label	TP1-1185
illustrated	Not Illustrated
issn	14248220
topic_title	TP1-1185 Optimized Distributed Generalized Reed-Solomon Coding with Space-Time Block Coded Spatial Modulation generalized Reed–Solomon (GRS) coded cooperation space-time block coded spatial modulation (STBC-SM)
topic	misc TP1-1185 misc generalized Reed–Solomon (GRS) misc coded cooperation misc space-time block coded spatial modulation (STBC-SM) misc Chemical technology
topic_unstemmed	misc TP1-1185 misc generalized Reed–Solomon (GRS) misc coded cooperation misc space-time block coded spatial modulation (STBC-SM) misc Chemical technology
topic_browse	misc TP1-1185 misc generalized Reed–Solomon (GRS) misc coded cooperation misc space-time block coded spatial modulation (STBC-SM) misc Chemical technology
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	Sensors
hierarchy_parent_id	331640910
hierarchy_top_title	Sensors
isfreeaccess_txt	true
familylinks_str_mv	(DE-627)331640910 (DE-600)2052857-7
title	Optimized Distributed Generalized Reed-Solomon Coding with Space-Time Block Coded Spatial Modulation
ctrlnum	(DE-627)DOAJ079214851 (DE-599)DOAJb183e2481f4741b293c6c18a28cf2f96
title_full	Optimized Distributed Generalized Reed-Solomon Coding with Space-Time Block Coded Spatial Modulation
author_sort	Chunli Zhao
journal	Sensors
journalStr	Sensors
callnumber-first-code	T
lang_code	eng
isOA_bool	true
recordtype	marc
publishDateSort	2022
contenttype_str_mv	txt
author_browse	Chunli Zhao Fengfan Yang Daniel Kariuki Waweru Chen Chen Hongjun Xu
container_volume	22
class	TP1-1185
format_se	Elektronische Aufsätze
author-letter	Chunli Zhao
doi_str_mv	10.3390/s22166305
author2-role	verfasserin
title_sort	optimized distributed generalized reed-solomon coding with space-time block coded spatial modulation
callnumber	TP1-1185
title_auth	Optimized Distributed Generalized Reed-Solomon Coding with Space-Time Block Coded Spatial Modulation
abstract	We present a well-known generalized Reed–Solomon (GRS) code incorporated with space-time block coded spatial modulation (STBC-SM) for wireless networks, which is capable of enjoying coded cooperation between the source and the relay. In the proposed distributed GRS-coded STBC-SM (DGRSC-STBC-SM) scheme, the source and relay nodes use distinct GRS codes. At the relay, we employ the concept of information selection to choose the message symbols from the source for further encoding. Thus, the codewords jointly constructed by the source and relay are generated at the destination. For achieving the best codeword set at the destination, we propose an optimal algorithm at the relay to select partial symbols from the source. To reduce the computational complexity, we propose a more practical algorithm with low complexity. Monte Carlo simulation results show that the proposed scheme using the low-complexity algorithm can achieve near-optimal error performance. Furthermore, our proposed scheme provides better error performance than its corresponding coded non-cooperative counterpart and the existing Reed–Solomon coded cooperative SM (RSCC-SM) scheme under identical conditions.
abstractGer	We present a well-known generalized Reed–Solomon (GRS) code incorporated with space-time block coded spatial modulation (STBC-SM) for wireless networks, which is capable of enjoying coded cooperation between the source and the relay. In the proposed distributed GRS-coded STBC-SM (DGRSC-STBC-SM) scheme, the source and relay nodes use distinct GRS codes. At the relay, we employ the concept of information selection to choose the message symbols from the source for further encoding. Thus, the codewords jointly constructed by the source and relay are generated at the destination. For achieving the best codeword set at the destination, we propose an optimal algorithm at the relay to select partial symbols from the source. To reduce the computational complexity, we propose a more practical algorithm with low complexity. Monte Carlo simulation results show that the proposed scheme using the low-complexity algorithm can achieve near-optimal error performance. Furthermore, our proposed scheme provides better error performance than its corresponding coded non-cooperative counterpart and the existing Reed–Solomon coded cooperative SM (RSCC-SM) scheme under identical conditions.
abstract_unstemmed	We present a well-known generalized Reed–Solomon (GRS) code incorporated with space-time block coded spatial modulation (STBC-SM) for wireless networks, which is capable of enjoying coded cooperation between the source and the relay. In the proposed distributed GRS-coded STBC-SM (DGRSC-STBC-SM) scheme, the source and relay nodes use distinct GRS codes. At the relay, we employ the concept of information selection to choose the message symbols from the source for further encoding. Thus, the codewords jointly constructed by the source and relay are generated at the destination. For achieving the best codeword set at the destination, we propose an optimal algorithm at the relay to select partial symbols from the source. To reduce the computational complexity, we propose a more practical algorithm with low complexity. Monte Carlo simulation results show that the proposed scheme using the low-complexity algorithm can achieve near-optimal error performance. Furthermore, our proposed scheme provides better error performance than its corresponding coded non-cooperative counterpart and the existing Reed–Solomon coded cooperative SM (RSCC-SM) scheme under identical conditions.
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_206 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2005 GBV_ILN_2009 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2055 GBV_ILN_2057 GBV_ILN_2111 GBV_ILN_2507 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700
container_issue	16, p 6305
title_short	Optimized Distributed Generalized Reed-Solomon Coding with Space-Time Block Coded Spatial Modulation
url	https://doi.org/10.3390/s22166305 https://doaj.org/article/b183e2481f4741b293c6c18a28cf2f96 https://www.mdpi.com/1424-8220/22/16/6305 https://doaj.org/toc/1424-8220
remote_bool	true
author2	Fengfan Yang Daniel Kariuki Waweru Chen Chen Hongjun Xu
author2Str	Fengfan Yang Daniel Kariuki Waweru Chen Chen Hongjun Xu
ppnlink	331640910
callnumber-subject	TP - Chemical Technology
mediatype_str_mv	c
isOA_txt	true
hochschulschrift_bool	false
doi_str	10.3390/s22166305
callnumber-a	TP1-1185
up_date	2024-07-03T22:19:08.900Z
_version_	1803598062060306432
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ079214851</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240414072659.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230307s2022 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.3390/s22166305</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ079214851</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJb183e2481f4741b293c6c18a28cf2f96</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TP1-1185</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Chunli Zhao</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Optimized Distributed Generalized Reed-Solomon Coding with Space-Time Block Coded Spatial Modulation</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2022</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">We present a well-known generalized Reed–Solomon (GRS) code incorporated with space-time block coded spatial modulation (STBC-SM) for wireless networks, which is capable of enjoying coded cooperation between the source and the relay. In the proposed distributed GRS-coded STBC-SM (DGRSC-STBC-SM) scheme, the source and relay nodes use distinct GRS codes. At the relay, we employ the concept of information selection to choose the message symbols from the source for further encoding. Thus, the codewords jointly constructed by the source and relay are generated at the destination. For achieving the best codeword set at the destination, we propose an optimal algorithm at the relay to select partial symbols from the source. To reduce the computational complexity, we propose a more practical algorithm with low complexity. Monte Carlo simulation results show that the proposed scheme using the low-complexity algorithm can achieve near-optimal error performance. Furthermore, our proposed scheme provides better error performance than its corresponding coded non-cooperative counterpart and the existing Reed–Solomon coded cooperative SM (RSCC-SM) scheme under identical conditions.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">generalized Reed–Solomon (GRS)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">coded cooperation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">space-time block coded spatial modulation (STBC-SM)</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Chemical technology</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Fengfan Yang</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Daniel Kariuki Waweru</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Chen Chen</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Hongjun Xu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Sensors</subfield><subfield code="d">MDPI AG, 2003</subfield><subfield code="g">22(2022), 16, p 6305</subfield><subfield code="w">(DE-627)331640910</subfield><subfield code="w">(DE-600)2052857-7</subfield><subfield code="x">14248220</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:22</subfield><subfield code="g">year:2022</subfield><subfield code="g">number:16, p 6305</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.3390/s22166305</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/b183e2481f4741b293c6c18a28cf2f96</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.mdpi.com/1424-8220/22/16/6305</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/1424-8220</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_206</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2057</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">22</subfield><subfield code="j">2022</subfield><subfield code="e">16, p 6305</subfield></datafield></record></collection>
score	7.400283

Nicht das Richtige dabei?

Schreiben Sie uns!

Optimized Distributed Generalized Reed-Solomon Coding with Space-Time Block Coded Spatial Modulation

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?