Upper Bounds on Matching Families in <formula formulatype="inline"> <tex Notation="TeX">$\BBZ_{pq}^{n}$</tex></formula>

DOI10.1109/TIT.2013.2257918zbMath1364.94748arXiv1301.0980OpenAlexW2137543927MaRDI QIDQ5346437

Yeow Meng Chee, San Ling, Liang Feng Zhang, Huaxiong Wang

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1301.0980

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Other types of codes (94B60)

This page was built for publication: Upper Bounds on Matching Families in <formula formulatype="inline"> <tex Notation="TeX">$\BBZ_{pq}^{n}$</tex></formula>