Decomposition methods and sampling circuits in the Cartesian lattice

DOI10.1007/3-540-44683-4_8MaRDI QIDQ4779136zbMATH OpenFDO

Authors Dana Randall

Publication date 25 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2136/21360074

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22)

Recommendations

• Algorithmic Number Theory
• Generalized sampling expansion on lattices
• Lattice invariant subspaces and sampling
• Lattice point identities and Shannon-type sampling
• Optimal Lattices for Sampling
• Approximation and decomposition in lattices of clutters
• Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs
• Decoding by Sampling: A Randomized Lattice Algorithm for Bounded Distance Decoding
• A Computable Fourier Condition Generating Alias-Free Sampling Lattices
• Construction of sampling theorems for unions of shifted lattices

Cited in

(5)

• Elementary bounds on mixing times for decomposable Markov chains
• The geometry of diagonal groups
• Disjoint Decomposition of Markov Chains and Sampling Circuits in Cayley Graphs
• scientific article; zbMATH DE number 7758305 (Why is no real title available?)
• Iterated decomposition of biased permutations via new bounds on the spectral gap of Markov chains

This page was built for publication: Decomposition methods and sampling circuits in the Cartesian lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4779136)