New Extremal Self-Dual Binary Codes of Length 68 via Composite Construction, F2 + uF2 Lifts, Extensions and Neighbors
dc.contributor.author | Dougherty, Steven | |
dc.contributor.author | Gildea, Joe | |
dc.contributor.author | Korban, Adrian | |
dc.contributor.author | Kaya, Abidin | |
dc.date.accessioned | 2020-03-03T09:26:59Z | |
dc.date.available | 2020-03-03T09:26:59Z | |
dc.date.issued | 2020-10-13 | |
dc.identifier.citation | Dougherty, S., Gildea, J., Korban, A. & Kaya, A. (2020). New extremal self-dual binary codes of length 68 via composite construction, F2 + uF2 lifts, extensions and neighbors. International Journal of Information and Coding Theory, 5(3-4), 211-226. https://doi.org/10.1504/IJICOT.2020.110703 | en_US |
dc.identifier.doi | 10.1504/IJICOT.2020.110703 | |
dc.identifier.uri | http://hdl.handle.net/10034/623218 | |
dc.description.abstract | We describe a composite construction from group rings where the groups have orders 16 and 8. This construction is then applied to find the extremal binary self-dual codes with parameters [32, 16, 8] or [32, 16, 6]. We also extend this composite construction by expanding the search field which enables us to find more extremal binary self-dual codes with the above parameters and with different orders of automorphism groups. These codes are then lifted to F2 + uF2, to obtain extremal binary images of codes of length 64. Finally, we use the extension method and neighbor construction to obtain new extremal binary self-dual codes of length 68. As a result, we obtain 28 new codes of length 68 which were not known in the literature before. | en_US |
dc.publisher | Inderscience | en_US |
dc.relation.url | https://www.inderscienceonline.com/doi/abs/10.1504/IJICOT.2020.110703 | |
dc.rights.uri | https://creativecommons.org/licenses/by-nc-nd/4.0/ | en_US |
dc.subject | Group rings | en_US |
dc.subject | Self-dual codes | en_US |
dc.subject | Codes over rings | en_US |
dc.title | New Extremal Self-Dual Binary Codes of Length 68 via Composite Construction, F2 + uF2 Lifts, Extensions and Neighbors | en_US |
dc.type | Article | en_US |
dc.identifier.eissn | 1753-7711 | en_US |
dc.contributor.department | University of Scranton; University of Chester; University of Chester; Sampoerna Academy; | en_US |
dc.identifier.journal | International Journal of Information and Coding Theory | en_US |
or.grant.openaccess | Yes | en_US |
rioxxterms.funder | N/A | en_US |
rioxxterms.identifier.project | N/A | en_US |
rioxxterms.version | AM | en_US |
rioxxterms.versionofrecord | https://doi.org/10.1504/IJICOT.2020.110703 | |
rioxxterms.licenseref.startdate | 2021-10-13 | |
rioxxterms.publicationdate | 2020-10-13 | |
rioxxterms.publicationdate | 2020-10-13 | |
dc.dateAccepted | 2020-02-29 | |
dc.date.deposited | 2020-03-03 | en_US |
dc.indentifier.issn | 1753-7703 | en_US |