Uniform Sampling of Linear Codes with Prescribed Hull Dimension
Keita Ishizuka
Abstract
We give exactly uniform samplers for linear codes with prescribed hull dimension, for the Euclidean, Hermitian, and symplectic inner products and over finite fields of every characteristic. Except for the Euclidean form over fields of odd characteristic, these are the first uniform samplers for arbitrary prescribed hull dimension. Each sample costs an expected O(k2 N + k q) field operations for codes of dimension k in a space of dimension N over Fq or Fq2.
Create a lesson
Related papers
Optimal Communication for Distributed Sparse Histogram Aggregation
Fangwei Ye, Yijun Fan
Hardware-Efficient Reinforcement-Learned Scheduling for Quantum LDPC Decoders
Mohsen Moradi, Vahid Nourozi, Wei Tang et al.
Making Every Edit Count: Efficient Binary Edit Correction at the Gilbert-Varshamov Bound
Ryan Gabrys, Shubhransh Singhvi, Eitan Yaakobi
Timely Ground-Station Status Delivery via UAV-Assisted Data Collection and Hierarchical RL
Xiangjian Gao, Mohammad Moltafet, Hamid R. Sadjadpour
Quantum Private Information Retrieval on Forests
Mohamed Nomeir, Sennur Ulukus
An information-geometric formulation of distributed computation
Alberto Liardi, George Blackburne, Pedro A. M. Mediano