نتایج جستجو برای: consecutive separating
تعداد نتایج: 119701 فیلتر نتایج به سال:
2004
Tor Helleseth
Hans Georg Schaathun
Separating codes find applications in many fields including automata theory and digital fingerprinting. It is known that the Kerdock code of sufficient order is (2 1)and (2 2)-separating, but the separating weight is only known by a lower bound due to Sagalovich. In this correspondence, we prove that the lower bound on the (2 1)-separating weight is met with equality.
Journal:
:Journal of Functional Analysis
1989
Journal:
:ANNALS OF THE ORADEA UNIVERSITY. Fascicle of Management and Technological Engineering.
2015
Journal:
:Journal of Physical Oceanography
1999
Journal:
:Journal of Geophysical Research: Space Physics
2014
Journal:
:The Boston Medical and Surgical Journal
1908
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید