{"id":"https://openalex.org/W4415368928","doi":"https://doi.org/10.1109/isit63088.2025.11195597","title":"A Design of Convolutional Gaussain Random Codes","display_name":"A Design of Convolutional Gaussain Random Codes","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415368928","doi":"https://doi.org/10.1109/isit63088.2025.11195597"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195597","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195597","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103423437","display_name":"Dengsheng Lin","orcid":null},"institutions":[{"id":"https://openalex.org/I150229711","display_name":"University of Electronic Science and Technology of China","ror":"https://ror.org/04qr3zq92","country_code":"CN","type":"education","lineage":["https://openalex.org/I150229711"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Dengsheng Lin","raw_affiliation_strings":["University of Electronic Science and Technology of China (UESTC),National Key Laboratory of Wireless Communications,Sichuan,China"],"affiliations":[{"raw_affiliation_string":"University of Electronic Science and Technology of China (UESTC),National Key Laboratory of Wireless Communications,Sichuan,China","institution_ids":["https://openalex.org/I150229711"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5103423437"],"corresponding_institution_ids":["https://openalex.org/I150229711"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.28732188,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10057","display_name":"Face and Expression Recognition","score":0.942799985408783,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10057","display_name":"Face and Expression Recognition","score":0.942799985408783,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/convolutional-code","display_name":"Convolutional code","score":0.7882999777793884},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.5400000214576721},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5293999910354614},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.474700003862381},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.4738999903202057},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.4478999972343445},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.44200000166893005},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4108999967575073}],"concepts":[{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.7882999777793884},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.620199978351593},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.5400000214576721},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5293999910354614},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5073999762535095},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.474700003862381},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.4738999903202057},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.4478999972343445},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.44200000166893005},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4108999967575073},{"id":"https://openalex.org/C64948573","wikidata":"https://www.wikidata.org/wiki/Q625117","display_name":"BCJR algorithm","level":5,"score":0.39399999380111694},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.388700008392334},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.3626999855041504},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.34040001034736633},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.3370000123977661},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3181000053882599},{"id":"https://openalex.org/C168167062","wikidata":"https://www.wikidata.org/wiki/Q1117970","display_name":"Component (thermodynamics)","level":2,"score":0.30090001225471497},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.29649999737739563},{"id":"https://openalex.org/C40969351","wikidata":"https://www.wikidata.org/wiki/Q3516228","display_name":"Word error rate","level":2,"score":0.28290000557899475},{"id":"https://openalex.org/C51267290","wikidata":"https://www.wikidata.org/wiki/Q5527848","display_name":"Gaussian random field","level":4,"score":0.2676999866962433},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2669999897480011},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.2669000029563904},{"id":"https://openalex.org/C128151799","wikidata":"https://www.wikidata.org/wiki/Q13563306","display_name":"Luby transform code","level":5,"score":0.26080000400543213}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195597","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195597","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4121457694","display_name":null,"funder_award_id":"2023YFE0115100","funder_id":"https://openalex.org/F4320335777","funder_display_name":"National Key Research and Development Program of China"}],"funders":[{"id":"https://openalex.org/F4320335777","display_name":"National Key Research and Development Program of China","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1991133427","https://openalex.org/W1993944611","https://openalex.org/W2012050536","https://openalex.org/W2019094564","https://openalex.org/W2022271272","https://openalex.org/W2045456583","https://openalex.org/W2075893898","https://openalex.org/W2087362480","https://openalex.org/W2088964829","https://openalex.org/W2098470405","https://openalex.org/W2099111195","https://openalex.org/W2106864314","https://openalex.org/W2121606987","https://openalex.org/W2122989348","https://openalex.org/W2128765501","https://openalex.org/W2149072083","https://openalex.org/W2150498905","https://openalex.org/W2156938362","https://openalex.org/W2162938069","https://openalex.org/W2165203736","https://openalex.org/W2165205968","https://openalex.org/W2167394661","https://openalex.org/W2403121992","https://openalex.org/W2964261606","https://openalex.org/W3007447106","https://openalex.org/W4205855417","https://openalex.org/W4225795197","https://openalex.org/W4289655367","https://openalex.org/W4289713104","https://openalex.org/W4394863101"],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"Gaussian":[3,18,37,79],"random":[4,19,38,80],"codes":[5,20,39,62,67,76,88],"based":[6],"on":[7],"convolutional":[8,36],"structures.":[9],"Firstly,":[10],"an":[11],"error":[12,30,46],"probability":[13,47],"upper":[14,43],"bound":[15,44],"for":[16,28],"finite-length":[17],"is":[21,71],"derived,":[22],"expressed":[23],"as":[24,65],"a":[25],"closed-form":[26],"solution":[27],"the":[29,42,54,86,90],"exponent.":[31],"It":[32],"also":[33],"proposes":[34],"regular":[35],"and":[40,57,68],"analyzes":[41],"of":[45,48],"their":[49],"component":[50,66],"codes.":[51,81],"To":[52],"improve":[53],"cutoff":[55],"rate":[56],"reduce":[58],"decoding":[59],"complexity,":[60],"polar":[61,75],"are":[63],"employed":[64],"SVD":[69],"precoding":[70],"introduced":[72],"to":[73,92],"transform":[74],"into":[77],"approximate":[78],"Numerical":[82],"verification":[83],"shows":[84],"that":[85],"proposed":[87],"have":[89],"potential":[91],"meet":[93],"high-performance":[94],"requirements":[95],"under":[96],"achievable":[97],"complexity":[98],"conditions.":[99]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-21T00:00:00"}