{"id":"https://openalex.org/W2170978368","doi":"https://doi.org/10.1109/icc.2009.5199152","title":"Low Complexity Encoder for Generalized Quasi-Cyclic Codes Coming from Finite Geometries","display_name":"Low Complexity Encoder for Generalized Quasi-Cyclic Codes Coming from Finite Geometries","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2170978368","doi":"https://doi.org/10.1109/icc.2009.5199152","mag":"2170978368"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2009.5199152","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2009.5199152","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Communications","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/A5011649552","display_name":"Vo Tam Van","orcid":null},"institutions":[{"id":"https://openalex.org/I4840577","display_name":"Toyota Technological Institute","ror":"https://ror.org/001hv0k59","country_code":"JP","type":"education","lineage":["https://openalex.org/I4840577"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"V. T. Van","raw_affiliation_strings":["Dept. Electronics and Information Science, Toyota Technological Institute, Nagoya, Japan"],"affiliations":[{"raw_affiliation_string":"Dept. Electronics and Information Science, Toyota Technological Institute, Nagoya, Japan","institution_ids":["https://openalex.org/I4840577"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006877645","display_name":"Hajime Matsui","orcid":"https://orcid.org/0000-0003-4778-8045"},"institutions":[{"id":"https://openalex.org/I4840577","display_name":"Toyota Technological Institute","ror":"https://ror.org/001hv0k59","country_code":"JP","type":"education","lineage":["https://openalex.org/I4840577"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"H. Matsui","raw_affiliation_strings":["Dept. Electronics and Information Science, Toyota Technological Institute, Nagoya, Japan"],"affiliations":[{"raw_affiliation_string":"Dept. Electronics and Information Science, Toyota Technological Institute, Nagoya, Japan","institution_ids":["https://openalex.org/I4840577"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113091572","display_name":"S. Mita","orcid":null},"institutions":[{"id":"https://openalex.org/I4840577","display_name":"Toyota Technological Institute","ror":"https://ror.org/001hv0k59","country_code":"JP","type":"education","lineage":["https://openalex.org/I4840577"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"S. Mita","raw_affiliation_strings":["Dept. Electronics and Information Science, Toyota Technological Institute, Nagoya, Japan"],"affiliations":[{"raw_affiliation_string":"Dept. Electronics and Information Science, Toyota Technological Institute, Nagoya, Japan","institution_ids":["https://openalex.org/I4840577"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5011649552"],"corresponding_institution_ids":["https://openalex.org/I4840577"],"apc_list":null,"apc_paid":null,"fwci":0.3621,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.68787916,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.6499369144439697},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.6253601312637329},{"id":"https://openalex.org/keywords/finite-field","display_name":"Finite field","score":0.5626857876777649},{"id":"https://openalex.org/keywords/encoder","display_name":"Encoder","score":0.5526349544525146},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.5114411115646362},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.4864084720611572},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.45253807306289673},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44608017802238464},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4460754692554474},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.4432706832885742},{"id":"https://openalex.org/keywords/raptor-code","display_name":"Raptor code","score":0.4339646100997925},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42396801710128784},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3067436218261719},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.22262388467788696}],"concepts":[{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.6499369144439697},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.6253601312637329},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.5626857876777649},{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.5526349544525146},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5114411115646362},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.4864084720611572},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.45253807306289673},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44608017802238464},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4460754692554474},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.4432706832885742},{"id":"https://openalex.org/C101252705","wikidata":"https://www.wikidata.org/wiki/Q7294373","display_name":"Raptor code","level":5,"score":0.4339646100997925},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42396801710128784},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3067436218261719},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.22262388467788696},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icc.2009.5199152","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2009.5199152","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Communications","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.165.7386","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.165.7386","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://sites.google.com/site/vtvan2k1/Home/vtvan_ICC_05-16-04.pdf?attredirects=0","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W53349146","https://openalex.org/W151586033","https://openalex.org/W1534925464","https://openalex.org/W1973127405","https://openalex.org/W1981970082","https://openalex.org/W2009370804","https://openalex.org/W2013217307","https://openalex.org/W2062642782","https://openalex.org/W2064759901","https://openalex.org/W2114869758","https://openalex.org/W2126259959","https://openalex.org/W2128765501","https://openalex.org/W2135764410","https://openalex.org/W2140655888","https://openalex.org/W2147776616","https://openalex.org/W2169484518","https://openalex.org/W2182112064","https://openalex.org/W3194602862","https://openalex.org/W4239889878","https://openalex.org/W6606084363"],"related_works":["https://openalex.org/W2127950068","https://openalex.org/W2150212378","https://openalex.org/W2015101254","https://openalex.org/W1851307089","https://openalex.org/W2209506458","https://openalex.org/W1580452828","https://openalex.org/W1996737726","https://openalex.org/W2127824344","https://openalex.org/W2383546851","https://openalex.org/W1917873986"],"abstract_inverted_index":{"We":[0,135],"define":[1],"generalized":[2],"quasi-cyclic":[3,17],"(GQC)":[4],"codes":[5,8,23,63,129,148],"as":[6,25],"linear":[7,153],"with":[9,70],"nontrivial":[10],"automorphism":[11],"groups.":[12],"Therefore,":[13],"GQC":[14,62,133],"codes,":[15,18],"unlike":[16],"can":[19,64],"include":[20],"many":[21],"important":[22,35],"such":[24],"Hermitian":[26],"and":[27,68,82,162],"projective":[28],"geometry":[29,126],"(PG)":[30],"codes;":[31],"this":[32],"capability":[33],"is":[34,77,92,119,149],"in":[36,115],"practical":[37],"applications.":[38],"Further,":[39],"we":[40,107],"propose":[41],"the":[42,95,110,116,122,138,152,156],"echelon":[43],"canonical":[44],"form":[45],"algorithm":[46,76],"for":[47,124,146],"computing":[48],"Grobner":[49,59],"bases":[50],"from":[51],"their":[52],"parity":[53],"check":[54],"matrices.":[55],"Consequently,":[56],"by":[57],"applying":[58],"base":[60],"theory,":[61],"be":[65],"systematically":[66],"encoded":[67],"implemented":[69],"simple":[71],"feedback":[72],"shift":[73],"registers.":[74],"Our":[75],"based":[78],"on":[79],"Gaussian":[80],"elimination":[81],"requires":[83],"a":[84,142,170],"sufficiently":[85],"small":[86],"number":[87,111],"of":[88,98,112,132,141,155,173],"finite-field":[89],"operations,":[90],"which":[91],"related":[93,150],"to":[94,102,121,151,168],"third":[96],"power":[97],"code-length.":[99],"In":[100],"order":[101,154],"demonstrate":[103],"our":[104],"encoder's":[105],"efficiency,":[106],"prove":[108],"that":[109,137],"circuit":[113],"elements":[114,165],"encoder":[117,144],"architecture":[118,145],"proportional":[120],"code-length":[123],"finite":[125],"(FG)":[127],"LDPC":[128],"(a":[130],"class":[131],"codes).":[134],"show":[136],"hardware":[139],"complexity":[140],"serial-in-serial-out":[143],"FG-LDPC":[147],"code-length;":[157],"less":[158],"than":[159],"2n":[160,163],"adder":[161],"memory":[164],"are":[166],"required":[167],"encode":[169],"binary":[171],"codeword":[172],"length":[174],"n.":[175]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}