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

Bo Hove

dblp:72/451 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1999
—ORCID · none

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

Theory of computation · 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 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory
generalized hamming weights
0.011999
Further Results on Generalized Hamming Weights for Goethals and Preparata Codes Over Z4 · IEEE Trans. Inf. Theory 1999
Coding theory › error-correcting codes › nonlinear codes
goethals code
0.011999
Further Results on Generalized Hamming Weights for Goethals and Preparata Codes Over Z4 · IEEE Trans. Inf. Theory 1999
Coding theory › error-correcting codes › block codes
linear code
0.011999
Further Results on Generalized Hamming Weights for Goethals and Preparata Codes Over Z4 · IEEE Trans. Inf. Theory 1999
Coding theory › error-correcting codes › nonlinear codes
preparata code
0.011999
Further Results on Generalized Hamming Weights for Goethals and Preparata Codes Over Z4 · IEEE Trans. Inf. Theory 1999
YearPublicationVenuePosition
1999 Further Results on Generalized Hamming Weights for Goethals and Preparata Codes Over Z4
abstract
This article contains results on the generalized Hamming weights (GHW) for the Goethals and Preparata codes over Z/sub 4/. We give an upper bound on the rth generalized Hamming weights d/sub r/(m,j) for the Goethals code G/sub m/(j) of length 2/sup m/ over Z/sub 4/, when m is odd. We also determine d/sub 3.5/(m,j) exactly. The upper bound is shown to be tight up to r=3.5. Furthermore, we determine the rth generalized Hamming weight d/sub r/(m) for the Preparata code of length 2/sup m/ over Z/sub 4/ when r=3.5 and r=4.
Tor Helleseth, Bo Hove, Kyeongcheol Yang
IEEE Trans. Inf. Theory2