Multipoint codes are a broad class of algebraic geometry codes derived from algebraic functions which have multiple poles and/or zeros on their defining curves. Thus, they are more general than one-point codes which a...
详细信息
ISBN:
(纸本)9784885522673
Multipoint codes are a broad class of algebraic geometry codes derived from algebraic functions which have multiple poles and/or zeros on their defining curves. Thus, they are more general than one-point codes which are an important class of algebraic codes. In this paper, we give several improved codes of multipoint codes derived from Hermitian curves by using an improving method introduced by Feng and Rao for one-point codes.
We enumerate a list of 594 inequivalent binary (33,16) doubly-even self-orthogonal codes that have no all-zero coordinates along with their automorphism groups. It is proven that if a (22, 8, 4) Balanced Incomplete Bl...
详细信息
We enumerate a list of 594 inequivalent binary (33,16) doubly-even self-orthogonal codes that have no all-zero coordinates along with their automorphism groups. It is proven that if a (22, 8, 4) Balanced Incomplete Block Design were to exist then the 22 rows of its incident matrix will be contained in at least one of the 594 codes. Without using computers, we eliminate this possibility for 116 of these codes. (C) 2005 Wiley Periodicals, Inc. J Combin Designs 13: 363-376, 2005.
The rows of a point by block incidence matrix of a design can be used to generate a code, the point code of the design. It is known that binary point codes of non-isomorphic Steiner triple systems of order hr STS(v), ...
详细信息
The rows of a point by block incidence matrix of a design can be used to generate a code, the point code of the design. It is known that binary point codes of non-isomorphic Steiner triple systems of order hr STS(v), are inequivalent when v less than or equal to 15, but whether this also holds for higher orders has been open. In the current paper, an example of two non-isomorphic STS(19) with equivalent point codes is presented. (C) 2004 Wiley Periodicals, Inc.
The point code of a Steiner triple system always contains vectors of weight equal to the replication number. The existence of Stainer triple systems whose point code has minimum weight less than the replication number...
详细信息
The point code of a Steiner triple system always contains vectors of weight equal to the replication number. The existence of Stainer triple systems whose point code has minimum weight less than the replication number is examined. In particular, the possible minimum weights are determined. (C) 2001 Elsevier Science B.V. All rights reserved.
The point code of a Steiner triple system uniquely determines the system when the number of vectors whose weight equals the replication number agrees with the number of points. The existence of a Steiner triple system...
详细信息
The point code of a Steiner triple system uniquely determines the system when the number of vectors whose weight equals the replication number agrees with the number of points. The existence of a Steiner triple system with this minimum point code property is established for all v equivalent 1, 3 (mod 6) with v>=15.
Methods fur implementing SS7 functions are proposed for a large-capacity decentralized switching node;they satisfy the condition of hiding distributed configurations from adjacent nodes. First, line accommodation and ...
详细信息
Methods fur implementing SS7 functions are proposed for a large-capacity decentralized switching node;they satisfy the condition of hiding distributed configurations from adjacent nodes. First, line accommodation and acquisition methods are clarified fur a large-capacity switching node in which multiple modules are used to realize trunk circuits and SS7 signaling links. Two methods are then proposed for allocating SS7 functions within the switching node. One distributes the functions over multiple circuit-switched modules (distributed allocation) while the other centralizes the functions in dedicated signaling modules (centralized allocation). We quantitatively evaluate both methods in terms of node scale versus the number of modules and signaling links required, the inter-module data transfer rate required, and the node traffic handling capacity when a particular module fails. From the evaluation results, we show that the distributed allocation should be employed fur small-scale nodes and the centralized allocation for large-scale nodes. We also show the effectiveness of a method for avoiding a characteristic problem that arises when a particular module fails. Finally, we implement an experimental system as an example.
暂无评论