Publication Information

{'id': 'https://openalex.org/W2097024980', 'doi': 'https://doi.org/10.1109/isit.2003.1228218', 'title': 'An efficient siso algorithm for reed-solomon codes', 'display_name': 'An efficient siso algorithm for reed-solomon codes', 'publication_year': 2003, 'publication_date': '2003-01-01', 'ids': {'openalex': 'https://openalex.org/W2097024980', 'doi': 'https://doi.org/10.1109/isit.2003.1228218', 'mag': '2097024980'}, 'language': 'en', 'primary_location': {'is_oa': False, 'landing_page_url': 'https://doi.org/10.1109/isit.2003.1228218', 'pdf_url': None, 'source': None, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}, 'type': 'article', 'type_crossref': 'proceedings-article', 'indexed_in': ['crossref'], 'open_access': {'is_oa': False, 'oa_status': 'closed', 'oa_url': None, 'any_repository_has_fulltext': False}, 'authorships': [{'author_position': 'first', 'author': {'id': 'https://openalex.org/A5060136616', 'display_name': 'V. Ponnampalam', 'orcid': None}, 'institutions': [], 'countries': ['AU'], 'is_corresponding': False, 'raw_author_name': 'V. Ponnampalam', 'raw_affiliation_strings': ['Cambridge Positioning Systems Limited, NSW, Australia'], 'affiliations': [{'raw_affiliation_string': 'Cambridge Positioning Systems Limited, NSW, Australia', 'institution_ids': []}]}, {'author_position': 'last', 'author': {'id': 'https://openalex.org/A5072485708', 'display_name': 'Alex Grant', 'orcid': 'https://orcid.org/0000-0002-5345-7771'}, 'institutions': [{'id': 'https://openalex.org/I170239107', 'display_name': 'University of South Australia', 'ror': 'https://ror.org/01p93h210', 'country_code': 'AU', 'type': 'education', 'lineage': ['https://openalex.org/I170239107']}], 'countries': ['AU'], 'is_corresponding': False, 'raw_author_name': 'A. Grant', 'raw_affiliation_strings': ['Institute for Telecommunications Research, University of South Australia, Mawson Lakes, SA, Australia'], 'affiliations': [{'raw_affiliation_string': 'Institute for Telecommunications Research, University of South Australia, Mawson Lakes, SA, Australia', 'institution_ids': ['https://openalex.org/I170239107']}]}], 'institution_assertions': [], 'countries_distinct_count': 1, 'institutions_distinct_count': 1, 'corresponding_author_ids': [], 'corresponding_institution_ids': [], 'apc_list': None, 'apc_paid': None, 'fwci': 0.465, 'has_fulltext': True, 'fulltext_origin': 'ngrams', 'cited_by_count': 4, 'citation_normalized_percentile': {'value': 0.502149, 'is_in_top_1_percent': False, 'is_in_top_10_percent': False}, 'cited_by_percentile_year': {'min': 72, 'max': 74}, 'biblio': {'volume': None, 'issue': None, 'first_page': '204', 'last_page': '204'}, 'is_retracted': False, 'is_paratext': 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/T10125', 'display_name': 'Advanced Wireless Communication Techniques', 'score': 0.9977, '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/T11797', 'display_name': 'graph theory and CDMA systems', 'score': 0.9892, '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/bcjr-algorithm', 'display_name': 'BCJR algorithm', 'score': 0.8658792}, {'id': 'https://openalex.org/keywords/turbo-code', 'display_name': 'Turbo code', 'score': 0.77674925}, {'id': 'https://openalex.org/keywords/reed–solomon-error-correction', 'display_name': 'Reed–Solomon error correction', 'score': 0.53968906}, {'id': 'https://openalex.org/keywords/berlekamp–welch-algorithm', 'display_name': 'Berlekamp–Welch algorithm', 'score': 0.41934025}], 'concepts': [{'id': 'https://openalex.org/C64948573', 'wikidata': 'https://www.wikidata.org/wiki/Q625117', 'display_name': 'BCJR algorithm', 'level': 5, 'score': 0.8658792}, {'id': 'https://openalex.org/C78944582', 'wikidata': 'https://www.wikidata.org/wiki/Q5158264', 'display_name': 'Concatenated error correction code', 'level': 4, 'score': 0.8011818}, {'id': 'https://openalex.org/C114504821', 'wikidata': 'https://www.wikidata.org/wiki/Q2164281', 'display_name': 'Turbo code', 'level': 3, 'score': 0.77674925}, {'id': 'https://openalex.org/C11413529', 'wikidata': 'https://www.wikidata.org/wiki/Q8366', 'display_name': 'Algorithm', 'level': 1, 'score': 0.75704265}, {'id': 'https://openalex.org/C33529081', 'wikidata': 'https://www.wikidata.org/wiki/Q18378194', 'display_name': 'Serial concatenated convolutional codes', 'level': 5, 'score': 0.6947506}, {'id': 'https://openalex.org/C157125643', 'wikidata': 'https://www.wikidata.org/wiki/Q884707', 'display_name': 'Block code', 'level': 3, 'score': 0.6654284}, {'id': 'https://openalex.org/C41008148', 'wikidata': 'https://www.wikidata.org/wiki/Q21198', 'display_name': 'Computer science', 'level': 0, 'score': 0.6129893}, {'id': 'https://openalex.org/C78065487', 'wikidata': 'https://www.wikidata.org/wiki/Q1061598', 'display_name': 'Reed–Solomon error correction', 'level': 5, 'score': 0.53968906}, {'id': 'https://openalex.org/C2400350', 'wikidata': 'https://www.wikidata.org/wiki/Q1752667', 'display_name': 'Linear code', 'level': 4, 'score': 0.5214716}, {'id': 'https://openalex.org/C132727834', 'wikidata': 'https://www.wikidata.org/wiki/Q4892328', 'display_name': 'Berlekamp–Welch algorithm', 'level': 5, 'score': 0.41934025}, {'id': 'https://openalex.org/C57273362', 'wikidata': 'https://www.wikidata.org/wiki/Q576722', 'display_name': 'Decoding methods', 'level': 2, 'score': 0.35491502}, {'id': 'https://openalex.org/C80444323', 'wikidata': 'https://www.wikidata.org/wiki/Q2878974', 'display_name': 'Theoretical computer science', 'level': 1, 'score': 0.34165308}], 'mesh': [], 'locations_count': 1, 'locations': [{'is_oa': False, 'landing_page_url': 'https://doi.org/10.1109/isit.2003.1228218', 'pdf_url': None, 'source': None, 'license': None, 'license_id': None, 'version': None, 'is_accepted': False, 'is_published': False}], 'best_oa_location': None, 'sustainable_development_goals': [], 'grants': [], 'datasets': [], 'versions': [], 'referenced_works_count': 9, 'referenced_works': ['https://openalex.org/W1497821700', 'https://openalex.org/W1976480044', 'https://openalex.org/W2113354092', 'https://openalex.org/W2119364535', 'https://openalex.org/W2142927000', 'https://openalex.org/W2146694142', 'https://openalex.org/W2165900331', 'https://openalex.org/W2167657277', 'https://openalex.org/W2987657883'], 'related_works': ['https://openalex.org/W2781337694', 'https://openalex.org/W2383546851', 'https://openalex.org/W2247418595', 'https://openalex.org/W2209506458', 'https://openalex.org/W2150212378', 'https://openalex.org/W2127950068', 'https://openalex.org/W2015101254', 'https://openalex.org/W2010879611', 'https://openalex.org/W1534925464', 'https://openalex.org/W1503126716'], 'abstract_inverted_index': {'There': [0], 'has': [1], 'been': [2], 'renewed': [3], 'interest': [4], 'in': [5, 117, 178, 192, 230, 247], 'iterative': [6, 20, 89], 'decod-': [7], 'ing': [8], 'algorithms': [9], 'for': [10, 78, 135, 166, 235, 257], 'concatenated': [11, 31, 92], 'codes': [12, 32, 40, 41, 46, 80, 103, 244], 'since': [13], 'the': [14, 185, 200, 236], 'introduction': [15], 'of': [16, 26, 101, 111, 147, 173, 205, 218, 221], 'Turbo': [17, 52], 'codes.': [18, 44, 83, 137, 223], 'Such': [19, 45], 'methods': [21], 'are': [22, 64, 245], 'built': [23], 'on': [24, 199, 240], 'top': [25], 'soft-in-': [27], 'soft-out': [28], 'algorithms.': [29, 95], 'Powerful': [30], 'may': [33, 175], 'be': [34, 48, 105, 142, 176], 'con-': [35], 'structed': [36], 'with': [37], 'linear': [38, 108], 'block': [39], 'as': [42, 107, 151, 169, 210], 'constituent': [43], 'can': [47, 104, 140], 'better': [49], 'alternatives': [50], 'to': [51, 126, 144, 195], 'Codes': [53], 'either': [54], 'when': [55, 60], 'high': [56], 'coding': [57], 'rates': [58], 'or': [59], 'short': [61], 'interleaver': [62], 'lengths': [63], 'required.': [65], 'This': [66], 'paper': [67, 207], 'presents': [68], 'a': [69, 170, 215], 'computationally': [70], 'efficient': [71, 119], 'maximum': [72], 'a-posteriori': [73], '(MAP)': [74], 'soft-in-soft-out': [75], '(SISO)': [76], 'algorithm': [77, 134, 139, 187, 197, 227, 238], 'RS': [79, 102, 136, 148, 222, 243], 'and': [81, 255], 'related': [82], 'Index': [84], 'Terms—Reed-Solomon': [85], 'codes,': [86, 93, 149], 'soft': [87], 'decoding,': [88], 'de-': [90], 'coding,': [91], 'SISO': [94], 'I.': [96], 'I': [97], 'NTRODUCTION': [98], 'binary': [99], 'images': [100], 'represented': [106], 'combi-': [109], 'nations': [110], 'two': [112], 'sub-field': [113], 'sub-codes': [114, 146], 'which': [115, 150], 'results': [116, 234], 'an': [118, 128], 'decoding': [120, 133, 226], 'algorithm.': [121], 'We': [122, 181], 'exploit': [123], 'this': [124, 206], 'property': [125], 'derive': [127], 'effi-': [129], 'cient': [130], 'soft-output': [131], 'MAP': [132, 196], 'The': [138, 159, 203, 224], 'also': [141, 163, 182], 'applied': [143, 198, 239], 'some': [145], 'we': [152], 'will': [153], 'show': [154, 183], 'later': [155], 'have': [156], 'good': [157], 'performance.': [158], 'al-': [160], 'gorithm': [161], 'is': [162, 188, 208, 228], 'well': [164], 'suited': [165], 'hardware': [167], 'implementation,': [168], 'significant': [171], 'number': [172], 'computations': [174], 'performed': [177], 'par-': [179], 'allel.': [180], 'that': [184], 'proposed': [186, 225, 237], 'many': [189], 'orders': [190], 'lower': [191], 'complexity': [193], 'compared': [194], 'Wolf': [201], 'trellis.': [202], 'remainder': [204], 'organized': [209], 'follows.': [211], 'Section': [212, 231, 248, 251], 'II': [213], 'gives': [214, 253], 'brief': [216], 'overview': [217], 'algebraic': [219], 'properties': [220], 'presented': [229], 'III.': [232], 'Simulation': [233], 'prod-': [241], 'uct': [242], 'given': [246], 'IV.': [249], 'Finally,': [250], 'V,': [252], 'conclusions': [254], 'directions': [256], 'future': [258], 'work.': [259]}, 'cited_by_api_url': 'https://api.openalex.org/works?filter=cites:W2097024980', 'counts_by_year': [], 'updated_date': '2024-12-11T10:55:07.038959', 'created_date': '2016-06-24'}