<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05075370</id>
  <dt>j</dt>
  <an>05075370</an>
  <augroup>
    <au>Cao, Zhenfu</au>
    <au>Ge, Gennian</au>
    <au>Miao, Ying</au>
  </augroup>
  <ti>Combinatorial characterizations of one-coincidence frequency-hopping sequences.</ti>
  <so>Des. Codes Cryptography 41, No. 2, 177-184 (2006).</so>
  <py>2006</py>
  <pu>Springer, Norwell, MA</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>Frequency-hopping (FH) sequence</ut>
    <ut>One-coincidence</ut>
    <ut>Optimum</ut>
    <ut>Perfect Mendelsohn packing</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/s10623-006-9007-8</li>
  </ligroup>
  <abgroup>
    <ab>Summary: Combinatorial characterizations of one-coincidence frequency-hopping (FH) sequences are provided in terms of perfect Mendelsohn packings. As a consequence, results on perfect Mendelsohn packings can be immediately applied to one-coincidence FH sequences.</ab>
    <rv></rv>
  </abgroup>
</item>