{"id":"https://openalex.org/W2157841224","doi":"https://doi.org/10.1109/isit.2004.1365296","title":"Sparse factor graph representations of reed-solomon and related codes","display_name":"Sparse factor graph representations of reed-solomon and related codes","publication_year":2004,"publication_date":"2004-12-23","ids":{"openalex":"https://openalex.org/W2157841224","doi":"https://doi.org/10.1109/isit.2004.1365296","mag":"2157841224"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2004.1365296","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365296","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","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/A5018906281","display_name":"Jonathan S. Yedidia","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"J.S. Yedidia","raw_affiliation_strings":["MERL, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"MERL, Cambridge, MA, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5018906281"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3864,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.85887535,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"259","last_page":"259"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":1.0,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9980000257492065,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9977999925613403,"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/factor-graph","display_name":"Factor graph","score":0.908110499382019},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6336551308631897},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.5115919709205627},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4933690130710602},{"id":"https://openalex.org/keywords/reed\u2013solomon-error-correction","display_name":"Reed\u2013Solomon error correction","score":0.48840492963790894},{"id":"https://openalex.org/keywords/dense-graph","display_name":"Dense graph","score":0.4596395790576935},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43494290113449097},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.408191978931427},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.35890674591064453},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.29620814323425293},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.2840699255466461},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.18779626488685608},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.1097293496131897}],"concepts":[{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.908110499382019},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6336551308631897},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.5115919709205627},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4933690130710602},{"id":"https://openalex.org/C78065487","wikidata":"https://www.wikidata.org/wiki/Q1061598","display_name":"Reed\u2013Solomon error correction","level":5,"score":0.48840492963790894},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.4596395790576935},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43494290113449097},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.408191978931427},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.35890674591064453},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.29620814323425293},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.2840699255466461},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.18779626488685608},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.1097293496131897},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit.2004.1365296","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365296","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.3.7103","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.7103","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.merl.com/papers/docs/TR2003-135.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.320.7363","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.320.7363","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.merl.com/reports/docs/TR2003-135.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1581232847","https://openalex.org/W2100852839","https://openalex.org/W2105333058","https://openalex.org/W2117897450","https://openalex.org/W2139584447","https://openalex.org/W2144727550","https://openalex.org/W2169415915","https://openalex.org/W4210992409","https://openalex.org/W6677821599"],"related_works":["https://openalex.org/W162456724","https://openalex.org/W2963817320","https://openalex.org/W4307680413","https://openalex.org/W1568966867","https://openalex.org/W3138245144","https://openalex.org/W1557056212","https://openalex.org/W2757251458","https://openalex.org/W2157841224","https://openalex.org/W2963204888","https://openalex.org/W4300023225"],"abstract_inverted_index":{"We":[0,31],"present":[1],"sparse":[2,57],"factor":[3,39,60],"graph":[4,40],"representations":[5,16,41],"of":[6,37],"Reed-Solomon":[7],"codes":[8,52],"based":[9],"on":[10],"a":[11],"fast":[12,58],"Fourier":[13],"transform.":[14],"These":[15],"can":[17,53],"be":[18,44,54],"used":[19],"to":[20],"create":[21],"encoders,":[22],"or":[23],"message-passing":[24],"decoders":[25],"that":[26,42,49],"use":[27],"soft":[28],"input":[29],"information.":[30],"discuss":[32],"various":[33],"simplifications":[34],"and":[35],"transformations":[36],"the":[38],"may":[43],"useful.":[45],"Finally,":[46],"we":[47],"show":[48],"other":[50],"interesting":[51],"represented":[55],"using":[56],"transform":[59],"graphs.":[61]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}