{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,14]],"date-time":"2023-11-14T18:13:41Z","timestamp":1699985621122},"reference-count":21,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T00:00:00Z","timestamp":1189728000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Communication"],"published-print":{"date-parts":[[2008,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Hermitian codes are a class of very long algebraic\u2010geometric (AG) codes constructed from Hermitian curves, which outperform Reed\u2013Solomon codes defined over the same finite fields and with the same code rates, as recently demonstrated by the authors. However, since there are no soft\u2010decision decoding algorithms for AG codes in the literature, the performance of Hermitian codes is limited and their potential is yet to be realized. An alternative method for achieving more significant coding gains is presented in this paper by serially concatenating long Hermitian codes with ring\u2010trellis\u2010coded modulation codes over the ring of integers \u2124<jats:sub>4<\/jats:sub> and evaluating their performance through simulation results on the AWGN and Rayleigh fading channels. The scheme achieves large coding gains over single Hermitian and Reed\u2013Solomon codes with no increase in bandwidth use and a performance comparable with the well\u2010known capacity\u2010approaching codes. Copyright \u00a9 2007 John Wiley &amp; Sons, Ltd.<\/jats:p>","DOI":"10.1002\/dac.901","type":"journal-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T10:16:21Z","timestamp":1189764981000},"page":"419-434","source":"Crossref","is-referenced-by-count":0,"title":["Serial concatenation of Hermitian codes with ring\u2010TCM codes"],"prefix":"10.1002","volume":"21","author":[{"given":"Martin","family":"Johnston","sequence":"first","affiliation":[]},{"given":"Rolando A.","family":"Carrasco","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2007,9,14]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"75","article-title":"Codes on algebraic curves","volume":"24","author":"Goppa VD","year":"1981","journal-title":"Soviet Mathematica Doklady"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.32157"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1049\/ip-com:20045153"},{"issue":"1","key":"e_1_2_1_5_2","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1049\/ip-com:20050241","article-title":"Performance of Hermitian codes using combined error and erasure decoding","volume":"153","author":"Johnston M","year":"2006","journal-title":"IEE Proceedings Communications"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1049\/ip-com:19949908"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1049\/ip-com:19960739"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.661517"},{"issue":"11","key":"e_1_2_1_9_2","first-page":"713","article-title":"Space\u2013time ring\u2010TCM codes for QPSK on time varying fast fading channels","volume":"37","author":"Pereira A","year":"2001","journal-title":"IEE Electronic Letters"},{"key":"e_1_2_1_10_2","unstructured":"ShawCB CarrascoRA.Space\u2013time ring\u2010TCM over urban cellular mobile radio. ISCTA 2003: Seventh International Symposium on Communication Theory and Application Ambleside Lake District U.K. 2003."},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1960.1057586"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(88)80033-6"},{"key":"e_1_2_1_13_2","volume-title":"Algebraic Coding Theory","author":"Berlekamp ER","year":"1968"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1969.1054260"},{"issue":"6","key":"e_1_2_1_15_2","first-page":"1663","article-title":"Fast decoding of codes from algebraic plane curves","volume":"38","author":"Justesen J","year":"1992","journal-title":"IEEE Transactions on Information Theory"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.179340"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.476240"},{"key":"e_1_2_1_18_2","volume-title":"Codes, Curves and Signals: Common Threads in Communications","author":"Sakata S","year":"1999"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056454"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1049\/ip-com:19971039"},{"key":"e_1_2_1_21_2","volume-title":"Digital Communications","author":"Proakis JG","year":"2000"},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.681314"}],"container-title":["International Journal of Communication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fdac.901","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/dac.901","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,14]],"date-time":"2023-11-14T17:43:50Z","timestamp":1699983830000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/dac.901"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,14]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,4]]}},"alternative-id":["10.1002\/dac.901"],"URL":"https:\/\/doi.org\/10.1002\/dac.901","archive":["Portico"],"relation":{},"ISSN":["1074-5351","1099-1131"],"issn-type":[{"value":"1074-5351","type":"print"},{"value":"1099-1131","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9,14]]}}}