Supply chain management is a key component of the Electronic-China Yuan (e-CNY) infrastructure and is crucial to developing and using e-CNY. This paper first provides an overview of the features of e-CNY and the idea of incorporating supply chain management into the creation of e-CNY software to better meet user payment requirements. This will help to reinforce the CNY's dominant position in the global monetary system. Meanwhile, this paper uses the fuzzy theory evaluation method to assess the software supply chain management informatization level. More broadly, this paper discusses the development level of digital enterprise supply chain management informatization to understand the current situation of e-CNY software supply chain management. The network's energy usage will increase when e-CNY software is developed. This research suggests a routing protocol based on the combination of chaotic particle swarm optimization (CPSO) and ant colony algorithm (ACA). It employs a new CPSO algorithm to optimize the cluster head selection.

In this correspondence, we extend the Gaussian wiretap channel model introduced by Leung-Yan-Cheong and Hellman to the Gaussian wiretap channel with side information by introducing additive white Gaussian interference in the main channel, which is available to the encoder in advance. This model is also an extension of the dirty-paper channel introduced by Costa since its main channel is the dirty-paper channel. A perfect-secrecy-achieving coding strategy for the model is proposed. It is used to derive achievable rates with asymptotic perfect secrecy and an achievable rate-equivocation region. The achievable rates with asymptotic perfect-secrecy are then compared to upper and lower bounds. The comparison indicates that the proposed coding strategy is optimal in some cases.

The noiseless wire-tap channel of type II with coset coding scheme was provided by Ozarow and Wyner. In this correspondence, the user is split into multiple parties who are coordinated in coding their data symbols by using the same encoder. The adversary can tap not only partial transmitted symbols but also partial data symbols. We are interested in the equivocation of the data symbols to this adversary who has more power than that of Ozarow and Wyner. The generalized Hamming weight of Wei and the dimension/length profile (DLP) of Forney are extended to two-code formats: relative generalized Hamming weight and relative dimension/length profile (RDLP). Upper and lower bounds of the new concepts are investigated. They are useful to design a perfect secrecy coding scheme for the coordinated multiparty model. Under a general secrecy standard, the coordinated model can provide a higher transmission rate than an uncoordinated (time-sharing) model.

There are a large number of linear block codes satisfying the chain condition. Their weight hierarchies are called chain good and form an important group in classifying all possible weight hierarchies. In this paper, we present a series of new sufficient conditions to determine which kinds of sequences are chain good weight hierarchies. Our results are efficient for the determination of the chain good weight hierarchies with high dimension.

A constant-composition code is a special constant-weight code under the restriction that each symbol should appear a given number of times in each codeword. In this correspondence, we give a lower bound for the maximum size of the q-ary constant-composition codes with minimum distance at least 3. This bound is asymptotically optimal and generalizes the Graham-Sloane bound for binary constant-weight codes. In addition, three construction methods of constant-composition codes are presented, and a number of optimum constant-composition codes are obtained by using these constructions.

Svanstrom (see IEEE ibid., vol.43, p.1630-2, Sept. 1997) gave a lower bound on the size of ternary constant-weight codes (CWCs). This bound is generalized and improved in some cases.

The depth distribution of a linear code was recently introduced by T. Etzion (see ibid., vol.43, pp.1361-3, July 1997). In this correspondence, a number of basic and interesting properties for the depth of finite words and the depth distribution of linear codes are obtained. In addition, we study the enumeration problem of counting the number of linear subcodes with the prescribed depth constraints, and derive some explicit and interesting enumeration formulas. Furthermore, we determine the depth distribution of Reed-Muller code RM (m,r). Finally, we show that there are exactly nine depth-equivalence classes for the ternary [11,6,5] Golay codes.