{"id":"https://openalex.org/W2169341474","doi":"https://doi.org/10.1109/isit.2009.5205673","title":"On the number of minimum weight codewords of SFA-LDPC codes","display_name":"On the number of minimum weight codewords of SFA-LDPC codes","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2169341474","doi":"https://doi.org/10.1109/isit.2009.5205673","mag":"2169341474"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2009.5205673","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205673","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","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/A5113863452","display_name":"Yuichi Kaji","orcid":null},"institutions":[{"id":"https://openalex.org/I75917431","display_name":"Nara Institute of Science and Technology","ror":"https://ror.org/05bhada84","country_code":"JP","type":"education","lineage":["https://openalex.org/I75917431"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Yuichi Kaji","raw_affiliation_strings":["Graduate School of Information Science, Nara Institute of Science and Technology, Ikoma, Nara, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Information Science, Nara Institute of Science and Technology, Ikoma, Nara, Japan","institution_ids":["https://openalex.org/I75917431"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5113863452"],"corresponding_institution_ids":["https://openalex.org/I75917431"],"apc_list":null,"apc_paid":null,"fwci":0.7243,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.76778046,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"108","issue":"202","first_page":"70","last_page":"74"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9997000098228455,"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.9997000098228455,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9994999766349792,"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"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.998199999332428,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.8101598024368286},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.7336350679397583},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7181233763694763},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.6202930212020874},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5393469333648682},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.5338640809059143},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5326257348060608},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.49823951721191406},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4758550822734833},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.4573071300983429},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.45508792996406555},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.45375537872314453},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.4442148804664612},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.4347879886627197},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4304342269897461},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3572234511375427},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.3427373766899109},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24070245027542114},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.18392303586006165}],"concepts":[{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.8101598024368286},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.7336350679397583},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7181233763694763},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.6202930212020874},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5393469333648682},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5338640809059143},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5326257348060608},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.49823951721191406},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4758550822734833},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.4573071300983429},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.45508792996406555},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.45375537872314453},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.4442148804664612},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.4347879886627197},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4304342269897461},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3572234511375427},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3427373766899109},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24070245027542114},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.18392303586006165},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2009.5205673","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205673","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"mag:2904780435","is_oa":false,"landing_page_url":"https://www.ieice.org/ken/paper/20080912Fafk/eng/","pdf_url":null,"source":{"id":"https://openalex.org/S4306512848","display_name":"IEICE Technical Report; IEICE Tech. Rep.","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"IEICE Technical Report; IEICE Tech. Rep.","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1607198972","https://openalex.org/W1760355913","https://openalex.org/W2079767843","https://openalex.org/W2103495212","https://openalex.org/W2128765501","https://openalex.org/W2942696485","https://openalex.org/W3140968660","https://openalex.org/W7067619172"],"related_works":["https://openalex.org/W2479327835","https://openalex.org/W2110972223","https://openalex.org/W2163036861","https://openalex.org/W1584569498","https://openalex.org/W73995444","https://openalex.org/W2000151856","https://openalex.org/W3105618276","https://openalex.org/W60780125","https://openalex.org/W2132973822","https://openalex.org/W2107986584"],"abstract_inverted_index":{"The":[0,37],"number":[1,24],"of":[2,15,25,29,39,53,57,66,83,89,100,104,107],"minimum":[3,26,54,67,101],"weight":[4,27,55,68,102],"codewords":[5,28,56,92,103],"is":[6,44,48,60,74],"an":[7],"important":[8],"parameter":[9],"to":[10],"measure":[11],"the":[12,23,51,58,81,90,96,98],"potential":[13],"performance":[14],"a":[16,40,77],"linear":[17],"block":[18],"code.":[19],"This":[20],"paper":[21],"studies":[22],"simple":[30],"and":[31,46],"full-length":[32],"array":[33],"(SFA)":[34],"LDPC":[35],"codes.":[36],"notion":[38],"cyclic":[41,63,71],"shift":[42,64,72],"closure":[43,73],"introduced,":[45],"it":[47],"shown":[49],"that":[50],"set":[52],"code":[59],"partitioned":[61],"by":[62,113],"closures":[65],"codewords.":[69],"Each":[70],"generated":[75],"from":[76],"special":[78,91],"codeword.":[79],"With":[80],"help":[82],"computer":[84],"experiment,":[85],"general":[86],"algebraic":[87],"forms":[88],"are":[93,110],"determined.":[94],"As":[95],"result,":[97],"numbers":[99],"several":[105],"classes":[106],"SFA-LDPC":[108],"codes":[109],"clearly":[111],"expressed":[112],"formulas.":[114]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}