Construction of optimal ternary constant weight codes via Bhaskar Rao designs

In this note, we consider a construction for optimal ternary constant weight codes (CWCs) via Bhaskar Rao designs (BRDs). The known existence results for BRDs are employed to generate many new optimal nonlinear ternary CWCs with constant weight 4 and minimum Hamming distance 5.     

Negacyclic duadic codes

This paper extends the concepts from cyclic duadic codes to negacyclic codes over F_q (q an odd prime power) of oddly even length. Generalizations of defining sets, multipliers, splittings, even-like and odd-like codes are given. Necessary and sufficient conditions are given for the existence of self-dual negacyclic codes over F_q and the existence of splittings of 2N, where N is odd. Other negacyclic codes can be extended by two coordinates in a way to create self-dual codes with familiar parameters.     

An improvement of discrete Tardos fingerprinting codes

It has been proven that the code lengths of Tardos’s collusion-secure fingerprinting codes are of theoretically minimal order with respect to the number of adversarial users (pirates). However, the code lengths can be further reduced as some preceding studies have revealed. In this article we improve a recent discrete variant of Tardos’s codes, and give a security proof of our codes under an assumption weaker than the original Marking Assumption. Our analysis shows that our codes have significantly shorter lengths than Tardos’s codes. For example, when c = 8, our code length is about 4.94% of Tardos’s code in a practical setting and about 4.62% in a certain limit case. Our code lengths for large c are asymptotically about 5.35% of Tardos’s codes. A part of this work was presented at 17th Applied Algebra, Algebraic Algorithms, and Error Correcting Codes (AAECC-17), Bangalore, India, December 16–20, 2007.     

一类四元环上常循环码是自由码的充要条件

本文研究了环F2 uF2上的奇长度的循环码和(1 u)-循环码.运用代数方法,得到了F2 uF2上的循环码和(1 u)-循环码成为自由码的几个充要条件.推广了Bonnecaze(1999)和Aydin(2002)的关于自由码的结果.     

Lower bounds on the minimum average distance of binary codes

Let β(n,M) denote the minimum average Hamming distance of a binary code of length n and cardinality M. In this paper we consider lower bounds on β(n,M). All the known lower bounds on β(n,M) are useful when M is at least of size about 2ⁿ⁻¹/n. We derive new lower bounds which give good estimations when size of M is about n. These bounds are obtained using a linear programming approach. In particular, it is proved that lim_n→∞β(n,2n)=5/2. We also give a new recursive inequality for β(n,M).     

广义Hamming重量的广义Griesmer界进一步分析

通过对q元线性码广义Hamming重量dr(·)的分析,应用支撑重量ωs(C)的性质,再次分析了q元[n,k]线性码广义Griesmer界n≥dr+sum from i=1 to k-r[(q-1)dr/qi(qr-1)].     

Hyperon beta-decay and axial charges of the lambda in view of strongly distorted baryon wave-functions

Within the collective coordinate approach to chiral soliton models we suggest that breaking of SU(3) flavor symmetry mainly resides in the baryon wave-functions while the charge operators maintain a symmetric structure. Sizable symmetry breaking in the wave-functions is required to reproduce the observed spacing in the spectrum of the  baryons. The matrix elements of the flavor symmetric charge operators nevertheless yield g_A/g_V ratios for hyperon beta-decay which agree with the empirical data approximately as well as the successful F&D parameterization of the Cabibbo scheme. Demanding the strangeness component in the nucleon to vanish in the two flavor limit of the model, determines the structure of the singlet axial charge operator and yields the various quark flavor components of the axial charge of the Λ-hyperon. The suggested picture gains support from calculations in a realistic model using pion and vector meson degrees of freedom to build up the soliton.     

On pairs of permutable Hermitian surfaces

We investigate the intersection R of two permutable Hermitian surfaces of PG(3,q²), q odd. We show that R is a determinantal variety. From the combinatorial point of view R comprises a complete (q²+1)-span of the two corresponding Hermitian surfaces.     

Partial permutation decoding for the first-order Reed-Muller codes

Partial permutation decoding is shown to apply to the first-order Reed-Muller codes R(1,m), where m>4 by finding s-PD-sets for these codes for 2≤s≤4.