Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ted Hurley

dblp:67/6675 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2008
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
algebraic coding theory
0.112008
A Group Ring Construction of the Extended Binary Golay Code · IEEE Trans. Inf. Theory 2008
Coding theory › error-correcting codes › perfect codes
golay code
0.112008
A Group Ring Construction of the Extended Binary Golay Code · IEEE Trans. Inf. Theory 2008
Coding theory › algebraic structure
group algebra
0.112008
A Group Ring Construction of the Extended Binary Golay Code · IEEE Trans. Inf. Theory 2008

Methods — techniques the papers use, named apart from their topics

zero divisor code construction · 0.1
YearPublicationVenuePosition
2008 A Group Ring Construction of the Extended Binary Golay Code
abstract
We give a new construction of the extended binary Golay code. The code is constructed as a zero divisor code over the dihedral group of twenty-four elements, D24. The construction is algebraic, much like the construction of the (23,12,7) binary Golay code from a polynomial.
Ian McLoughlin 0001, Ted Hurley
IEEE Trans. Inf. Theory2
2007 Module Codes in Group Rings
abstract
A new construction method for codes using encodings from group rings is presented. They consist primarily of two types, zero-divisor and unit-derived codes. Previous codes from group rings focused on ideals; e.g. cyclic codes are ideals in the group ring over a cyclic group. The fresh focus is on the encodings themselves, which only under very limited conditions result in ideals. Using an isomorphism between group rings and a certain well- defined ring of matrices, equivalent matrix codes are established with resulting generator and check matrices. Group rings are a fruitful source of units and zero-divisors from which new codes result. Many code properties may more easily be expressed in terms of group ring properties.
Paul Hurley, Ted Hurley
ISIT2