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

Daniel Pook-Kolb

dblp:332/1904 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
0000-0001-7317-1087ORCID · corroborated

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

Theory of computation · 2 · 2 since 2021

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
2 papers
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory
lattice theory
1.622025
Optimization and Identification of Lattice Quantizers · IEEE Trans. Inf. Theory 2025
Glued Lattices Are Better Quantizers Than K12 · IEEE Trans. Inf. Theory 2024
Coding theory › source coding
quantization
1.622025
Optimization and Identification of Lattice Quantizers · IEEE Trans. Inf. Theory 2025
Glued Lattices Are Better Quantizers Than K12 · IEEE Trans. Inf. Theory 2024
Coding theory › source coding › quantization › structured vector quantization
lattice quantization
0.812024
Glued Lattices Are Better Quantizers Than K12 · IEEE Trans. Inf. Theory 2024

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

theta series · 0.9stochastic gradient descent · 0.9lattice gluing · 0.8
YearPublicationVenuePosition
2025 Optimization and Identification of Lattice Quantizers
abstract
Lattices with minimal normalized second moments are designed using a new numerical optimization algorithm. Starting from a random lower-triangular generator matrix and applying stochastic gradient descent, all elements are updated towards the negative gradient, which makes it the most efficient algorithm proposed so far for this purpose. A graphical illustration of the theta series, called theta image, is introduced and shown to be a powerful tool for converting numerical lattice representations into their underlying exact forms. As a proof of concept, optimized lattices are designed in dimensions up to 16. In all dimensions, the algorithm converges to either the previously best known lattice or a better one. The dual of the 15-dimensional laminated lattice is conjectured to be optimal in its dimension and its exact normalized second moment is computed.
Erik Agrell, Daniel Pook-Kolb, Bruce Allen
IEEE Trans. Inf. Theory2
2024 Glued Lattices Are Better Quantizers Than K12
abstract
40 years ago, Conway and Sloane proposed using the highly symmetrical Coxeter–Todd latticeK12for quantization, and estimated its second moment. Since then, all published lists identifyK12as the best 12-dimensional lattice quantizer. Surprisingly,K12is not optimal: we construct two new 12-dimensional lattices with lower normalized second moments. The new lattices are obtained by gluing together products of two 6-dimensional lattices.
Erik Agrell, Daniel Pook-Kolb, Bruce Allen
IEEE Trans. Inf. Theory2