This algorithm implements the Hu-Tucker method of variable length, minimum redundancy alphabetic binary encoding [1]. The symbols of the alphabet are considered to be an ordered forest of n terminal nodes. Two nodes i...
详细信息
This algorithm implements the Hu-Tucker method of variable length, minimum redundancy alphabetic binary encoding [1]. The symbols of the alphabet are considered to be an ordered forest of n terminal nodes. Two nodes in an ordered forest are said to be tentative-connecting if the sequence of nodes between the two given nodes is either empty or consists entirely of nonterminal nodes.
Because of their algebraic structure and simple hardware implementation, linear codes as class of error-correcting codes, are used in a multitude of situations such as Compact disk, backland bar code, satellite and wi...
详细信息
Because of their algebraic structure and simple hardware implementation, linear codes as class of error-correcting codes, are used in a multitude of situations such as Compact disk, backland bar code, satellite and wireless communication, storage systems, ISBN numbers and so more. Nevertheless, the design of linear codes with high minimum Hamming distance to a given dimension and length of the code, remains an open challenge in coding theory. In this work, we propose a code construction method for constructing good binary linear codes from popular ones, while using the Hadamard matrix. The proposed method takes advantage of the MacWilliams identity for computing the weight distribution, to overcome the problem of computing the minimum Hamming distance for larger dimensions.
Both reliability and security are two important subjects in modern digital communications, each with a variety of subdisciplines. In this paper we introduce a new proposed secure turbo coding system which combines cha...
详细信息
Both reliability and security are two important subjects in modern digital communications, each with a variety of subdisciplines. In this paper we introduce a new proposed secure turbo coding system which combines chaotic dynamics and turbo coding reliability together. As we utilize the chaotic maps as a tool for hiding and securing the coding design in turbo coding system, this proposed system model can provide both data secrecy and data reliability in one process to combat problems in an insecure and unreliable data channel link. To support our research, we provide different schemes to design a chaotic secure reliable turbo coding system which we call chaotic-switched turbo coding schemes. In these schemes the design of turbo codes chaotically changed depending on one or more chaotic maps. Extensions of these chaotic-switched turbo coding schemes to half-duplex relay systems are also described. Results of simulations of these new secure turbo coding schemes are compared to classical turbo codes with the same coding parameters and the proposed system is able to achieve secured reasonable bit error rate performance when it is made to switch between different puncturing and design configuration parameters especially with low switching rates.
Nuclide production cross sections measured at the Institute for Theoretical and Experimental Physics (ITEP) for the targets of natCr, 56Fe, natNi, 93Nb, 181Ta, natW, natPb, and 209Bi irradiated by protons with energie...
详细信息
Nuclide production cross sections measured at the Institute for Theoretical and Experimental Physics (ITEP) for the targets of natCr, 56Fe, natNi, 93Nb, 181Ta, natW, natPb, and 209Bi irradiated by protons with energies from 40 to 2600 MeV were used to estimate the predictive accuracy of several popular high-energy transport codes. A general agreement of the ITEP data with the data obtained by other groups, including the numerous GSI data measured by the inverse kinematics method was found. Simulations of the measured data were performed with the mcnpx (bertini and isabel options), cem03.02, incl4.2 + abla, incl4.5 + abla07, phits, and cascade.07 codes. Deviation factors between the calculated and experimental cross sections have been estimated for each target and for the whole energy range covered by our measurements. Two-dimensional diagrams of deviation factor values were produced for estimating the predictive power of every code for intermediate, not measured masses of nuclei targets and bombarding energies of protons. Further improvements of all tested here codes are recommended. In addition, new measurements at ITEP of nuclide yields from the 208Pb target irradiated by 500-MeV protons are presented. A good agreement between these new data and the GSI measurements obtained by the inverse kinematics method was found.
The problem of building optimal block codes, such as MDS codes, over small fields has been an active area of research that led to several interesting conjectures. In the context of convolutional codes, optimal constru...
详细信息
The problem of building optimal block codes, such as MDS codes, over small fields has been an active area of research that led to several interesting conjectures. In the context of convolutional codes, optimal constructions, such as MDS or MDP, are very rare and all require very large finite fields. In this work, we focus on the problem of constructing optimal convolutional codes with respect to the rank distance, i.e. we study the construction of Maximum Rank Distance (MRD) convolutional codes. Considering convolutional codes within a very general framework, we present concrete novel classes of MRD convolutional codes for a large set of given parameters.
BibTeX format (bib) RIS format (RIS) Comma separated (CSV) Endnote format (TXT) Text format (TXT)RefWorks (Direct Export) Access this article Login optionsIndividual login Institutional loginvia Athens/Shibboleth Th...
详细信息
BibTeX format (bib) RIS format (RIS) Comma separated (CSV) Endnote format (TXT) Text format (TXT)RefWorks (Direct Export) Access this article Login optionsIndividual login Institutional loginvia Athens/Shibboleth The computer you are using is not registered by an institution with a subscription to this article. Please log in below. Find out more about journal subscriptions at your site.
Multisender authentication codes allow a group of senders to construct an authenticated message for one receiver such that the receiver can verify authenticity of the received message. In this paper, we construct one ...
详细信息
Multisender authentication codes allow a group of senders to construct an authenticated message for one receiver such that the receiver can verify authenticity of the received message. In this paper, we construct one multisender authentication code from pseudosymplectic geometry over finite fields. The parameters and the probabilities of deceptions of this code are also computed.
The Communications Web site, http://***, features more than a dozen bloggers in the BLOG@CACM community. In each issue of Communications, we'll publish selected posts or excerpts.twitterFollow us on Twitter at htt...
详细信息
The Communications Web site, http://***, features more than a dozen bloggers in the BLOG@CACM community. In each issue of Communications, we'll publish selected posts or excerpts.
twitter
Follow us on Twitter at http://***/blogCACM
http://***/blogs/blog-cacm
Philip Guo offers programmers 'Opportunistic Programming' tips that typically are not shared in school.
暂无评论