{"id":"https://openalex.org/W2137057606","doi":"https://doi.org/10.1109/isit.2009.5206026","title":"A note on BSD codes constructed from T-codes","display_name":"A note on BSD codes constructed from T-codes","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2137057606","doi":"https://doi.org/10.1109/isit.2009.5206026","mag":"2137057606"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2009.5206026","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5206026","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/A5072582772","display_name":"Ulrich Speidel","orcid":"https://orcid.org/0000-0001-9107-4918"},"institutions":[{"id":"https://openalex.org/I154130895","display_name":"University of Auckland","ror":"https://ror.org/03b94tp07","country_code":"NZ","type":"education","lineage":["https://openalex.org/I154130895"]}],"countries":["NZ"],"is_corresponding":true,"raw_author_name":"Ulrich Speidel","raw_affiliation_strings":["Department of Computer Science, University of Auckland, Auckland, New Zealand","Department of Computer Science, Tamaki Campus, The University of Auckland, Private Bag 92019, New Zealand"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Auckland, Auckland, New Zealand","institution_ids":["https://openalex.org/I154130895"]},{"raw_affiliation_string":"Department of Computer Science, Tamaki Campus, The University of Auckland, Private Bag 92019, New Zealand","institution_ids":["https://openalex.org/I154130895"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5072582772"],"corresponding_institution_ids":["https://openalex.org/I154130895"],"apc_list":null,"apc_paid":null,"fwci":0.6856,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.72360373,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"83","issue":null,"first_page":"2418","last_page":"2421"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12162","display_name":"Cellular Automata and Applications","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9970999956130981,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9965999722480774,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.7155483961105347},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6676724553108215},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.6668542623519897},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.635962188243866},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.593280017375946},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.54586261510849},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5433919429779053},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5309272408485413},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4991579055786133},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45252931118011475},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44963428378105164},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.4343739151954651},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28341734409332275},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.22160011529922485},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.1335940659046173},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07188749313354492}],"concepts":[{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.7155483961105347},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6676724553108215},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.6668542623519897},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.635962188243866},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.593280017375946},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.54586261510849},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5433919429779053},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5309272408485413},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4991579055786133},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45252931118011475},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44963428378105164},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.4343739151954651},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28341734409332275},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.22160011529922485},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.1335940659046173},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07188749313354492},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2009.5206026","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5206026","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"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.5099999904632568,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1525678880","https://openalex.org/W1975076306","https://openalex.org/W1982078145","https://openalex.org/W1983619746","https://openalex.org/W1986795304","https://openalex.org/W2037997478","https://openalex.org/W2048616123","https://openalex.org/W2077583313","https://openalex.org/W2086848345","https://openalex.org/W2098588592","https://openalex.org/W2127672066","https://openalex.org/W2140264069","https://openalex.org/W2323136735","https://openalex.org/W4236000351","https://openalex.org/W4285719527","https://openalex.org/W6604874203"],"related_works":["https://openalex.org/W135568846","https://openalex.org/W2460434904","https://openalex.org/W1789159349","https://openalex.org/W2113911300","https://openalex.org/W2151857680","https://openalex.org/W4386066307","https://openalex.org/W832867880","https://openalex.org/W2147254059","https://openalex.org/W917159298","https://openalex.org/W1975697476"],"abstract_inverted_index":{"The":[0,67,75],"T-augmentation":[1],"process":[2],"is":[3],"used":[4,24],"to":[5,25],"construct":[6,26],"variable-length":[7],"T-codes.":[8],"In":[9],"a":[10,41,49],"previous":[11],"paper,":[12],"the":[13,46,52],"author":[14],"and":[15,57],"T.A.":[16],"Gulliver":[17],"showed":[18],"that":[19],"it":[20],"may":[21,84],"also":[22,77],"be":[23],"block":[27],"codes":[28],"with":[29],"bounded":[30],"synchronization":[31,53],"delay":[32,54],"(BSD":[33],"codes)":[34],"as":[35,63],"subsets":[36,83],"of":[37,40,48,81],"T-code":[38],"codewords":[39],"fixed":[42],"length.":[43],"However,":[44],"only":[45],"existence":[47],"bound":[50,60],"on":[51],"was":[55,61],"shown,":[56],"an":[58,64,72],"actual":[59],"left":[62],"open":[65],"problem.":[66],"present":[68],"paper":[69,76],"formulates":[70],"such":[71],"upper":[73],"bound.":[74],"discusses":[78],"whether":[79],"some":[80],"these":[82],"represent":[85],"maximal":[86],"comma-free":[87],"codes.":[88]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}