Báo cáo toán học: "Optimal four-dimensional codes over GF(8)" pot

... Sampson, A Technique for Generating Gray Codes, Journal of Statistical Planning and Inference, 5 (1981) 171-180. [7] L. Goddyn, G.M. Lawrence and E. Nemeth, Gray Codes with Optimized Run Lengths, Utilitas ... A Technique for Generating Specialized Gray Codes, IEEE Trans. Comput. C-29 (1980) 329-331. [9] D.G.Wagner and J. West, Construction of Uniform Gray Codes, Congressus Numer- antium...

Ngày tải lên: 07/08/2014, 06:20

Ngày tải lên: 07/08/2014, 06:23

... in Theorem 3 in [6]. The diameter of G(10688; 3, 57) is 579, not 59 as it is stated there. Moreover the stated digraph is isomorphic to G(10688; 1, 19) by the unit 3563 ∈ Z  10688 . However ... kind of digraphs. Not only we can link an L-shaped tile to a given digraph G, but also we can recover the original digraph (or an isomorphical one) from its related tile. It is important to remark ......

Ngày tải lên: 07/08/2014, 07:21

... family of ‘reflected’ Gray codes (RGC) which has seen countless applications. Certain applications in engineering, statistics and computer science require specialized Gray codes with properties not ... Paterson, Jonathan Tuliani, Some new circuit codes, IEEE Trans. In- form. Theory 44 (1998), 1306–1309. [6] Carla Savage, A survey of combinatorial Gray codes, SIAM Rev. 39 (1997), 605–629....

Ngày tải lên: 07/08/2014, 07:21

... achieved the following: Theorem 5.6 M n is semi-nonevasive over Z for n ≤ 6 and n =8. Moreover, M 7 is semi-nonevasive over Z 3 , but not over Z. Proof. The first part of the theorem is straightforward ... (semi-nonevasive) over F, then the join ∆ ∗ Γ is semi-collapsible (semi-nonevasive) over F.If∆ ∗ Γ is semi-nonevasive over F and evasive, then each of ∆ and Γ is semi-nonevasive...

Ngày tải lên: 07/08/2014, 08:22

... these papers the authors used covering codes, that are quite well known [3]. We refer the reader to [14] for an online up-to date bibliography about identifying codes. In the general case  ≥ ... 119–128. [3]G.Cohen,I.Honkala,S.Litsyn,A.Lobstein,Covering Codes, Elsevier, North- Holland Mathematical Library (1997). [4] A.G.D’yachkov,V.V.Rykov,Bounds on the length of disjunctive codes, Pro...

Ngày tải lên: 07/08/2014, 08:22

Ngày tải lên: 05/08/2014, 09:46

Ngày tải lên: 05/08/2014, 10:20

Ngày tải lên: 05/08/2014, 15:20

Ngày tải lên: 05/08/2014, 15:20