Contents

Ars Combinatoria

  • Research article

A Note on Set Families and Codes

Jingfeng Xu1, Jian Liu2
1China Institute for Actuarial Science, Central University of Finance and Economics, Beijing 100081, P. R. China
2School of Banking and Finance, University of International Business and Economics, Beijing 100029, P. R. China
  • Published: 31/07/2012

Abstract

We give two Frankl-like results on set systems with restrictions on set difference sizes and set symmetric difference sizes modulo prime powers. Based on a similar method, we also give a bound on codes satisfying the properties of Hamming distance modulo prime powers.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Jingfeng Xu, Jian Liu. A Note on Set Families and Codes[J], Ars Combinatoria, Volume 105. 293-298. .