Journal articles: 'Code distribution'

1

Zhang, X. N. "Secure code distribution." Computer 30, no. 6 (1997): 76–79. http://dx.doi.org/10.1109/2.587552.

APA, Harvard, Vancouver, ISO, and other styles

2

Velikova, Evgeniya, and Asen Bojilov. "On the Weight Distribution of the Coset Leaders of Constacyclic Codes." Serdica Journal of Computing 2, no. 2 (2008): 105–10. http://dx.doi.org/10.55630/sjc.2008.2.105-110.

Full text

Abstract:

Constacyclic codes with one and the same generator polynomial and distinct length are considered. We give a generalization of the previous result of the first author [4] for constacyclic codes. Suitable maps between vector spaces determined by the lengths of the codes are applied. It is proven that the weight distributions of the coset leaders don’t depend on the word length, but on generator polynomials only. In particular, we prove that every constacyclic code has the same weight distribution of the coset leaders as a suitable cyclic code.

APA, Harvard, Vancouver, ISO, and other styles

3

P. Shakila Banua. "A Novel Computational Framework for Weight Distributions in QR Codes: The Case of (57,29,17)." Advances in Nonlinear Variational Inequalities 28, no. 7s (2025): 63–71. https://doi.org/10.52783/anvi.v28.4484.

Full text

Abstract:

This study presents a novel methodology for deriving both the received polynomial and the error locator polynomial for the Quadratic Residue (QR) code (57,29,17). Utilizing a newly developed algorithm, the weight distribution of this QR code is efficiently computed through Magma computations. Furthermore, the study introduces an innovative algorithm specifically de- signed to calculate Lee weights for the QR code, enhancing the accuracy and efficiency of these computations. The proposed techniques significantly contribute to the field of coding theory by improving the decoding process and providing deeper insights into the properties of QR codes. Objectives: The paper presents a novel computational framework for analyzing the Quadratic Residue (QR) code (57,29,17). To compute the weight distribution of the QR code using an efficient algorithm implemented in Magma. To derive the Lee weight distribution of the QR code using a newly developed algorithm implemented in SageMath. To construct and analyze the error locator polynomial, which aids in error detection and correction for the QR code. Methods: Constructed the generator matrix using quadratic residues modulo 57. Generated codewords by taking linear combinations of rows in the matrix. Computed the Hamming weight of each codeword. Counted occurrences of different weights to form the weight distribution table. Defined the Lee weight metric for elements in ℤ57. Randomly generated codewords and calculated their Lee weights using parallel computing. Aggregated results to derive the Lee weight distribution of the QR code. Considered cases of 1 to 8 errors in the received polynomial. Derived the error locator polynomial for each case. Demonstrated the process of recovering the transmitted message using syndromes. Results: Successfully computed and tabulated the weight distribution of (57,29,17). Showed how different weights contribute to the structure and error-correcting capability of the code. Derived the Lee weight distribution, providing a new perspective for analyzing the QR code. Demonstrated that the Lee weight metric can be effectively applied to QR codes over finite rings. Derived error locator polynomials for different error cases. Confirmed that the QR code (57,29,17) can detect and correct up to 8 errors. Conclusions: In this study focuses on the in-depth analysis of the Quadratic Residue code (57, 29, 17) by deriving both its weight distribution and Lee weight distribution. The newly developed algorithms for calculating these distributions contribute significantly to understanding the code’s structure and its error detection and correction capabilities. Additionally, the error locator polynomial for the code has been successfully found, which further enhances its practical application in error correction

APA, Harvard, Vancouver, ISO, and other styles

4

Pan, Jeng-Shyang, Tao Liu, Bin Yan , Hong-Mei Yang , and Shu-Chuan Chu. "A Lossless-Recovery Secret Distribution Scheme Based on QR Codes." Entropy 25, no. 4 (2023): 653. http://dx.doi.org/10.3390/e25040653.

Full text

Abstract:

The visual cryptography scheme (VCS) distributes a secret to several images that can enhance the secure transmission of that secret. Quick response (QR) codes are widespread. VCS can be used to improve their secure transmission. Some schemes recover QR codes with many errors. This paper uses a distribution mechanism to achieve the error-free recovery of QR codes. An error-correction codeword (ECC) is used to divide the QR code into different areas. Every area is a key, and they are distributed to n shares. The loss of any share will make the reconstructed QR code impossible to decode normally. Stacking all shares can recover the secret QR code losslessly. Based on some experiments, the proposed scheme is relatively safe. The proposed scheme can restore a secret QR code without errors, and it is effective and feasible.

APA, Harvard, Vancouver, ISO, and other styles

5

DONGEN, VINCENT VAN. "COMPILING DISTRIBUTED LOOPS ONTO SPMD CODE." Parallel Processing Letters 04, no. 03 (1994): 301–12. http://dx.doi.org/10.1142/s0129626494000284.

Full text

Abstract:

Given a loop written in a sequential language and a block-cyclic distribution, we present some techniques for generating SPMD code to run on distributed-memory machines. This is illustrated on three types of loops: parallel loops without internal dependence, parallel loops with internal dependences, and loops with hidden parallelism. Two models of distributions are considered: the data distribution and the computation distribution. We argue here that the data distribution model together with the owner-computes rule is only well adapted for the first class of loops. For the other loops, we present the idea of using a computation distribution instead, and we show how this can be compiled for distributed-memory machines.

APA, Harvard, Vancouver, ISO, and other styles

6

GUERRINI, ELEONORA, EMMANUELA ORSINI, and MASSIMILIANO SALA. "COMPUTING THE DISTANCE DISTRIBUTION OF SYSTEMATIC NONLINEAR CODES." Journal of Algebra and Its Applications 09, no. 02 (2010): 241–56. http://dx.doi.org/10.1142/s0219498810003884.

Full text

Abstract:

The most important families of nonlinear codes are systematic. A brute-force check is the only known method to compute their weight distribution and distance distribution. On the other hand, it outputs also all closest word pairs in the code. In the black-box complexity model, the check is optimal among closest-pair algorithms. In this paper, we provide a Gröbner basis technique to compute the weight/distance distribution of any systematic nonlinear code. Also our technique outputs all closest pairs. Unlike the check, our method can be extended to work on code families.

APA, Harvard, Vancouver, ISO, and other styles

7

Dai, Bin, Wenwen Zhao, Jun Yang, and Lu Lv. "CODEC: Content Distribution with (N,K) Erasure Code in Manet." International journal of Computer Networks & Communications 6, no. 4 (2014): 39–51. http://dx.doi.org/10.5121/ijcnc.2014.6404.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

WEI, YILUN, BO WU, and QIJIN WANG. "ON THE GENERALISATION OF SIDEL’NIKOV’S THEOREM TO -ARY LINEAR CODES." Bulletin of the Australian Mathematical Society 101, no. 1 (2019): 157–62. http://dx.doi.org/10.1017/s0004972719000637.

Full text

Abstract:

We generalise Sidel’nikov’s theorem from binary codes to $q$-ary codes for $q>2$. Denoting by $A(z)$ the cumulative distribution function attached to the weight distribution of the code and by $\unicode[STIX]{x1D6F7}(z)$ the standard normal distribution function, we show that $|A(z)-\unicode[STIX]{x1D6F7}(z)|$ is bounded above by a term which tends to $0$ when the code length tends to infinity.

APA, Harvard, Vancouver, ISO, and other styles

9

Glory, V., and S. Domnic. "Re-Ordered FEGC and Block Based FEGC for Inverted File Compression." International Journal of Information Retrieval Research 3, no. 1 (2013): 71–88. http://dx.doi.org/10.4018/ijirr.2013010105.

Full text

Abstract:

Data compression has been widely used in many Information Retrieval based applications like web search engines, digital libraries, etc. to enable the retrieval of data to be faster. In these applications, universal codes (Elias codes (EC), Fibonacci code (FC), Rice code (RC), Extended Golomb code (EGC), Fast Extended Golomb code (FEGC) etc.) have been preferably used than statistical codes (Huffman codes, Arithmetic codes etc). Universal codes are easy to be constructed and decoded than statistical codes. In this paper, the authors have proposed two methods to construct universal codes based on the ideas used in Rice code and Fast Extended Golomb Code. One of the authors’ methods, Re-ordered FEGC, can be suitable to represent small, middle and large range integers where Rice code works well for small and middle range integers. It is also competing with FC, EGC and FEGC in representing small, middle and large range integers. But it could be faster in decoding than FC, EGC and FEGC. The authors’ another coder, Block based RFEGC, uses local divisor rather than global divisor to improve the performance (both compression and decompression) of RFEGC. To evaluate the performance of the authors’ coders, the authors have applied their methods to compress the integer values of the inverted files constructed from TREC, Wikipedia and FIRE collections. Experimental results show that their coders achieve better performance (both compression and decompression) for those files which contain significant distribution of middle and large range integers.

APA, Harvard, Vancouver, ISO, and other styles

10

Pryadko, Leonid P. "On maximum-likelihood decoding with circuit-level errors." Quantum 4 (August 6, 2020): 304. http://dx.doi.org/10.22331/q-2020-08-06-304.

Full text

Abstract:

Error probability distribution associated with a given Clifford measurement circuit is described exactly in terms of the circuit error-equivalence group, or the circuit subsystem code previously introduced by Bacon, Flammia, Harrow, and Shi. This gives a prescription for maximum-likelihood decoding with a given measurement circuit. Marginal distributions for subsets of circuit errors are also analyzed; these generate a family of related asymmetric LDPC codes of varying degeneracy. More generally, such a family is associated with any quantum code. Implications for decoding highly-degenerate quantum codes are discussed.

APA, Harvard, Vancouver, ISO, and other styles

11

Mukherjee, Rohan, Swarat Chaudhuri, and Chris Jermaine. "Searching a database of source codes using contextualized code search." Proceedings of the VLDB Endowment 13, no. 10 (2020): 1765–78. http://dx.doi.org/10.14778/3401960.3401972.

Full text

Abstract:

Consider the case where a programmer has written some part of a program, but has left part of the program (such as a method or a function body) incomplete. The goal is to use the context surrounding the missing code to automatically "figure out" which of the codes in the database would be useful to the programmer in order to help complete the missing code. The search is "contextualized" in the sense that the search engine should use clues in the partially-completed code to figure out which database code is most useful. The user should not be required to formulate an explicit query. We cast contextualized code search as a learning problem, where the goal is to learn a distribution function computing the likelihood that each database code completes the program, and propose a neural model for predicting which database code is likely to be most useful. Because it will be prohibitively expensive to apply a neural model to each code in a database of millions or billions of codes at search time, one of our key technical concerns is ensuring a speedy search. We address this by learning a "reverse encoder" that can be used to reduce the problem of evaluating each database code to computing a convolution of two normal distributions.

APA, Harvard, Vancouver, ISO, and other styles

12

Durairajan, C., J. Mahalakshmi та P. Chella Pandian. "On the ℤq-Simplex codes and its weight distribution for dimension 2". Discrete Mathematics, Algorithms and Applications 07, № 03 (2015): 1550030. http://dx.doi.org/10.1142/s1793830915500305.

Full text

Abstract:

In this paper, we have defined ℤq-linear code and constructed some new codes. In particular, we have introduced the concept of ℤq-Simplex codes and proved that it is a [Formula: see text]-linear code for any integer q ≥ 2 and k ≥ 3 where p is the least order element in ℤq. We have given the weight distribution of ℤq-Simplex codes of dimension 2 when q is a prime power and when q is a product of distinct primes.

APA, Harvard, Vancouver, ISO, and other styles

13

Seungsu, Yuk, Tak Nam-il, and Chang Jo Keun. "DEVELOPMENT OF PIN-LEVEL NEUTRONICS/THERMAL-FLUID ANALYSIS COUPLED CODE SYSTEM FOR A BLOCK-TYPE HTGR CORE." EPJ Web of Conferences 247 (2021): 02041. http://dx.doi.org/10.1051/epjconf/202124702041.

Full text

Abstract:

Recently, the coupling between computer codes that simulate different physical phenomena has attracted for more accurate analysis. In the case of high-temperature gas-cooled reactor (HTGR), the coupling between neutronics and thermal-fluid analysis is necessary because of large change of temperature in the reactor core. Korea Atomic Energy Research Institute (KAERI) has developed the coupled code system between a reactor physics analysis code CAPP and a thermal-fluid system safety analysis code GAMMA+ for a block-type HTGR. The CAPP/GAMMA+ coupled code system provides more accurate block-wise distribution data than CAPP or GAMMA+ stand-alone analysis. However, the block-wise distribution data has the limitation in order to predict safety parameters such as the maximum temperature of the nuclear fuel. It is necessary to calculate refined distribution, for example, pin-level (fuel compact level) distribution. In this study, we tried to solve this problem by coupling CAPP and a high-fidelity thermal-fluid analysis code CORONA. CORONA can perform a high-fidelity thermal-fluid analysis of Computational Fluid Dynamics (CFD) level by dividing a block-type HTGR core into small lattices. On the other hand, CAPP can provide a pin power distribution. It is expected that the refined, more accurate distribution data for a block-type HTGR can be obtained by coupling these two codes. This paper presents the development of coupled code system between CAPP and CORONA, and then it is tested on a simple HTGR column problem with encouraging results.

APA, Harvard, Vancouver, ISO, and other styles

14

Mohammed, Mensouri, and Aaroud Abdessadek. "Weight Distribution and Bounds of Turbo-Code with 3 Dimensions." SIJ Transactions on Computer Networks & Communication Engineering 04, no. 02 (2016): 07–12. http://dx.doi.org/10.9756/sijcnce/v4i2/01010262.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Osugi, Akihito, Masaru Kashisako, and Kazushi Mimura. "Weight Distribution of a Nonlinear Code." Journal of the Physical Society of Japan 82, no. 11 (2013): 115003. http://dx.doi.org/10.7566/jpsj.82.115003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Ibrahim, Dr Mohammed, and Islam. "Large (k,3)-arcs in PG(2,19) and the related linear codes." Journal of Kufa for Mathematics and Computer 11, no. 1 (2024): 43–54. http://dx.doi.org/10.31642/jokmc/2018/110108.

Full text

Abstract:

A (n,r)-arc in a projective plane PG(2,q) is a set of n points such that some r, but no r+1 of them, are collinear. A (n,r)-arc is called complete if it is not contain in a (n+1,r)-arc. A linear -code over a finite field is a k-dimensional subspace of with minimum hamming distance d and length n. A code with parameters with Griesmer bound , is called Griesmer code. The major aim of this research is to find large size for the complete (k,3)-arcs in the projective plane of order nineteen PG(2,19) using the method of secants distributions, and the disjoint union of arcs, as well as, adding and removing points to (from) particular conic respectively. Also, we find the Griesmer codes that correspond to each large complete (k,3)-arcs, k=29,30,31. We introduced 20 inequivalent (29,3)-arcs up to secant distribution, 10 of them are complete. Also, we introduced 8 inequivalent (30,3)-arcs up to secant distribution, 2 of them are complete. Moreover, we construct 3 inequivalent complete (31,3)-arcs up to secant distribution, and then find the corresponding linear codes to some of the (29,3)-arcs, (30,3)-arcs and (31,3)-arcs. In particular, we established 3 types of Griesmer codes, and we find the weight enumerator that correspond to each one of them.

APA, Harvard, Vancouver, ISO, and other styles

17

Wang, Lan Xun, and Dan Fang Li. "A New Method for BCH Codes of Blind Recognition." Advanced Materials Research 631-632 (January 2013): 1403–8. http://dx.doi.org/10.4028/www.scientific.net/amr.631-632.1403.

Full text

Abstract:

According to the invariance property of the BCH code and Euclidean algorithm to calculate the greatest common factor (GCF) between code group and its cyclic shift code group. There is a method by using the degree distribution probability sum function of the greatest common factor to recognize the code length of BCH code. On this basis, the GCF can be extracted of the greatest degree distribution probability from the sum function, with the generator polynomial obtained by decomposing the GCF. The simulation results show that this method can achieve the recognition probability above 95% with BER of 4×10-3，and the high BER is much better to recognize the short codes.

APA, Harvard, Vancouver, ISO, and other styles

18

Blyudov, Anton, Dmitry Pivovarov, and Georgiy Pronin. "Power Distribution of Codes with the Lowest Alphabet Redundancy Depending on the Number of Bits and Code Distance." Proceedings of Petersburg Transport University 20, no. 2 (2023): 365–75. http://dx.doi.org/10.20295/1815-588x-2023-2-365-375.

Full text

Abstract:

Purpose: To investigate the dependence of the maximum power of codes on the number of digits and the minimum code distance; to find an approach to determine the optimal rules for constructing the check vector of a separable code from the point of view of ensuring minimal redundancy with a given reliability of message transmission. Methods: Computer simulation has been used to conduct experimental studies. For theoretical studies, the method of analytical review, graph theory, and coding theory have been applied. Results: Theoretical and experimental studies have obtained certain specific cases of power distribution for code alphabets with a given Hamming distance for various constant lengths, generated using the previously described algorithm. A method for doubling the power of arbitrary binary codes is proposed and described, as well as a method for obtaining codes with the least redundancy of powers M=2f, where f is a natural number for a predetermined minimum code distance by recursively using the method proposed in the article. Practical significance: An algorithm has been developed for doubling the power of the code alphabet while maintaining the required reliability of data transmission. A technique for analyzing the resulting matrices of code vectors is obtained in order to determine the rules for calculating check bits without using cyclic algorithms.

APA, Harvard, Vancouver, ISO, and other styles

19

Pathegama, Madhura, and Alexander Barg. "Smoothing of Binary Codes, Uniform Distributions, and Applications." Entropy 25, no. 11 (2023): 1515. http://dx.doi.org/10.3390/e25111515.

Full text

Abstract:

The action of a noise operator on a code transforms it into a distribution on the respective space. Some common examples from information theory include Bernoulli noise acting on a code in the Hamming space and Gaussian noise acting on a lattice in the Euclidean space. We aim to characterize the cases when the output distribution is close to the uniform distribution on the space, as measured by the Rényi divergence of order α∈(1,∞]. A version of this question is known as the channel resolvability problem in information theory, and it has implications for security guarantees in wiretap channels, error correction, discrepancy, worst-to-average case complexity reductions, and many other problems. Our work quantifies the requirements for asymptotic uniformity (perfect smoothing) and identifies explicit code families that achieve it under the action of the Bernoulli and ball noise operators on the code. We derive expressions for the minimum rate of codes required to attain asymptotically perfect smoothing. In proving our results, we leverage recent results from harmonic analysis of functions on the Hamming space. Another result pertains to the use of code families in Wyner’s transmission scheme on the binary wiretap channel. We identify explicit families that guarantee strong secrecy when applied in this scheme, showing that nested Reed–Muller codes can transmit messages reliably and securely over a binary symmetric wiretap channel with a positive rate. Finally, we establish a connection between smoothing and error correction in the binary symmetric channel.

APA, Harvard, Vancouver, ISO, and other styles

20

Avramova, M., A. Velazquez-Lozada, and A. Rubin. "Comparative Analysis of CTF and Trace Thermal-Hydraulic Codes Using OECD/NRC PSBT Benchmark Void Distribution Database." Science and Technology of Nuclear Installations 2013 (2013): 1–12. http://dx.doi.org/10.1155/2013/725687.

Full text

Abstract:

The international OECD/NRC PSBT benchmark has been established to provide a test bed for assessing the capabilities of thermal-hydraulic codes and to encourage advancement in the analysis of fluid flow in rod bundles. The benchmark was based on one of the most valuable databases identified for the thermal-hydraulics modeling developed by NUPEC, Japan. The database includes void fraction and departure from nucleate boiling measurements in a representative PWR fuel assembly. On behalf of the benchmark team, PSU in collaboration with US NRC has performed supporting calculations using the PSU in-house advanced thermal-hydraulic subchannel code CTF and the US NRC system code TRACE. CTF is a version of COBRA-TF whose models have been continuously improved and validated by the RDFMG group at PSU. TRACE is a reactor systems code developed by US NRC to analyze transient and steady-state thermal-hydraulic behavior in LWRs and it has been designed to perform best-estimate analyses of LOCA, operational transients, and other accident scenarios in PWRs and BWRs. The paper presents CTF and TRACE models for the PSBT void distribution exercises. Code-to-code and code-to-data comparisons are provided along with a discussion of the void generation and void distribution models available in the two codes.

APA, Harvard, Vancouver, ISO, and other styles

21

Fatimah Yusop, Syafiq Syazwan Mustafa, Mariah Awang, Nik Normunira Mat Hassan, and Hafsa Mohd Noor. "Comparison of Pressure Distribution of Naca 0012 Between CFD Code and Experimental." CFD Letters 14, no. 2 (2022): 35–41. http://dx.doi.org/10.37934/cfdl.14.2.3541.

Full text

Abstract:

Computational Fluid Dynamics (CFD) is a tool to solve engineering problem. Commercial CFD code are being used most engineering problem but rarely for external aerodynamic problem due some limitation of features. Compare to in house CFD code that able to written in certain area of interest and also implement specific discretization scheme to increase accuracy. In this work, the CFD code are developed by using high resolution scheme (ROE scheme and TVD scheme) for flow past through airfoil NACA 0012. Experimental result of wind tunnel is obtained from literature which are from Gregory and O’Reilly at Mach number M = 0.13 for different values of angle of attack at α= 0° and α = 10°. Another wind tunnel result from Haris at Mach number = 0.8 for different angles of attack α= 0° and α= 3.86°. Comparison results from the both codes indicate that developed CFD code by using TVD scheme able to give the closest result for both experimental.

APA, Harvard, Vancouver, ISO, and other styles

22

Favara, Giovanni, Francesca Loria, Gregory Marchal, and Egon Zakrajšek. "Monetary Policy and the Distribution of Income: Evidence from U.S. Metropolitan Areas." FEDS Notes, no. 2025-03-31 (March 2025): None. https://doi.org/10.17016/2380-7172.3757.

Full text

Abstract:

Our measure of the income distribution is derived from the IRS Statistics of Income (SOI), which tabulate individual income based on tax returns filed with the IRS. Starting in 1998, the IRS aggregates selected income and tax items annually, including adjusted gross (pre-tax) income and salaries and wages, to the zip code level. For each zip code and year, we use these data and information on the number of annual tax returns filed to compute (real) adjusted gross income and labor income per household. To the extent that households within zip codes are relatively homogeneous with respect to demographic characteristics, economic status, and living conditions, the SOI zip code data offer the best alternative to administrative data on individual income, which are not publicly available.

APA, Harvard, Vancouver, ISO, and other styles

23

Tamagno, Pierre, and Olivier Litaize. "Staggering of angular momentum distribution in fission." EPJ Web of Conferences 169 (2018): 00023. http://dx.doi.org/10.1051/epjconf/201816900023.

Full text

Abstract:

We review here the role of angular momentum distributions in the fission process. To do so the algorithm implemented in the FIFRELIN code [?] is detailed with special emphasis on the place of fission fragment angular momenta. The usual Rayleigh distribution used for angular momentum distribution is presented and the related model derivation is recalled. Arguments are given to justify why this distribution should not hold for low excitation energy of the fission fragments. An alternative ad hoc expression taking into account low-lying collectiveness is presented as has been implemented in the FIFRELIN code. Yet on observables currently provided by the code, no dramatic impact has been found. To quantify the magnitude of the impact of the low-lying staggering in the angular momentum distribution, a textbook case is considered for the decay of the 144Ba nucleus with low excitation energy.

APA, Harvard, Vancouver, ISO, and other styles

24

Ho, T. C. E., D. Surry, and A. G. Davenport. "Spatial distribution of peak cladding loads on tall buildings." Canadian Journal of Civil Engineering 19, no. 2 (1992): 199–211. http://dx.doi.org/10.1139/l92-026.

Full text

Abstract:

Wind tunnel tests on building models show that the patterns of cladding pressures are complex and varied. Their reliable representation, in a simple form, for building codes and standards presents a difficult conundrum. Necessarily, code descriptions need to be defined in terms of a few well-chosen parameters. In this paper, an approach is described which answers some of these difficulties. In essence, the actual pressure distributions from a wide variety of building shapes are broken down into systematic patterns of pressures which are inherent in all the distributions. These patterns can be found mathematically from the correlations of pressures at points across the surface. Pressure patterns on individual buildings can be reconstituted by combining these patterns in the right proportions. The proportions vary from building to building in a statistical manner. The important part of the pressure distributions is contained in the fundamental or simplest pattern; the more complicated higher-order patterns "fine tune" the pressure distribution. This hierarchy of patterns provides a logical basis for simplification (by truncation) and appropriate statistical treatment of the uncertainty. An application to the National Building Code of Canada suggests that the results described by the empirical procedures are very reasonable. Further, edge strips of higher pressure are not as statistically significant as first supposed. Key words: wind, tall buildings, local loads, code, statistics, orthogonal functions, variability, reliability.

APA, Harvard, Vancouver, ISO, and other styles

25

Abdulwahab, Walled K., and Abdulkareem A. Kadhim. "Internal pilot insertion for polar codes." Indonesian Journal of Electrical Engineering and Computer Science 22, no. 3 (2021): 1495. http://dx.doi.org/10.11591/ijeecs.v22.i3.pp1495-1504.

Full text

Abstract:

Two internal pilot insertion methods are proposed for polar codes to improve their error correction performance. The presented methods are based on a study of the weight distribution of the given polar code. The insertion of pilot bits provided a new way to control the coding rate of the modified polar code on the basis of the Hamming weight properties without sacrificing the code construction and the related channel condition. Rate control is highly demanded by 5G channel coding schemes. Two short-length polar codes were considered in the work with successive cancellation list decoding. The results showed that advantages in the range of 0.1 to 0.75 dB were obtained in the relative tolerance of the modified coded signal to the additive white Gaussian noise and fading channels at a bit error rate of 10<sup>−4</sup>. The simulation results also revealed that the performance improvements were possible with a careful insertion of the pilots. The modified polar code with pilot insertion provided performance improvement and offered the control of the coding rate without any added complexity at both the encoder and the decoder.

APA, Harvard, Vancouver, ISO, and other styles

26

Abdulwahab, Walled K., and Abdulkareem A. Kadhim. "Internal pilot insertion for polar codes." Indonesian Journal of Electrical Engineering and Computer Science 22, no. 3 (2021): 1495–504. https://doi.org/10.11591/ijeecs.v22.i3.pp1495-1504.

Full text

Abstract:

Two internal pilot insertion methods are proposed for polar codes to improve their error correction performance. The presented methods are based on a study of the weight distribution of the given polar code. The insertion of pilot bits provided a new way to control the coding rate of the modified polar code on the basis of the Hamming weight properties without sacrificing the code construction and the related channel condition. Rate control is highly demanded by 5G channel coding schemes. Two short-length polar codes were considered in the work with successive cancellation list decoding. The results showed that advantages in the range of 0.1 to 0.75 dB were obtained in the relative tolerance of the modified coded signal to the additive white Gaussian noise and fading channels at a bit error rate of 10−4. The simulation results also revealed that the performance improvements were possible with a careful insertion of the pilots. The modified polar code with pilot insertion provided performance improvement and offered the control of the coding rate without any added complexity at both the encoder and the decoder.

APA, Harvard, Vancouver, ISO, and other styles

27

Stein, Robert F., Åke Nordlund, Remo Collet, and Regner Trampedach. "The Stagger Code for Accurate and Efficient, Radiation-coupled Magnetohydrodynamic Simulations." Astrophysical Journal 970, no. 1 (2024): 24. http://dx.doi.org/10.3847/1538-4357/ad4706.

Full text

Abstract:

Abstract We describe the Stagger code for simulations of magnetohydrodynamic (MHD) systems. This is a modular code with a variety of physics modules that will let the user run simulations of deep stellar atmospheres, sunspot formation, stellar chromospheres and coronae, proto-stellar disks, star formation from giant molecular clouds, and even galaxy formation. The Stagger code is efficiently and highly parallelizable, enabling such simulations with large ranges of both spatial and temporal scales. We describe the methodology of the code and present the most important of the physics modules, as well as its input and output variables. We show results of a number of standard MHD tests to enable comparison with other, similar codes. In addition, we provide an overview of tests that have been carried out against solar observations, ranging from spectral line shapes, spectral flux distribution, limb darkening, intensity and velocity distributions of granulation, to seismic power spectra and the excitation of p-modes. The Stagger code has proven to be a high-fidelity code with a large range of uses.

APA, Harvard, Vancouver, ISO, and other styles

28

Orlitsky, A., K. Viswanathan, and J. Zhang. "Stopping Set Distribution of LDPC Code Ensembles." IEEE Transactions on Information Theory 51, no. 3 (2005): 929–53. http://dx.doi.org/10.1109/tit.2004.842571.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Cao, Zhengwen, Xinlei Chen, Geng Chai, and Jinye Peng. "IC-LDPC Polar codes-based reconciliation for continuous-variable quantum key distribution at low signal-to-noise ratio." Laser Physics Letters 20, no. 4 (2023): 045201. http://dx.doi.org/10.1088/1612-202x/acb920.

Full text

Abstract:

Abstract The error correction of information reconciliation affects the performance of the continuous-variable quantum key distribution (CV-QKD). Polar codes can be strictly proven to reach the Shannon-limit. However, due to the insufficient polarization of finite code-length, partial subchannels are neither completely noise-free nor completely noisy. In this paper, an intermediate channel low-density parity check code concatenated polar code (IC-LDPC Polar codes)-based reconciliation for CV-QKD is proposed for the above shortcomings. The experimental results show that the reconciliation efficiency of IC-LDPC Polar code can be over 98% when the signal-to-noise ratio is from −13.2 dB to −20.8 dB, the secret keys can be extracted, and the minimum frame error rate (FER) is 0.19. Therefore, the proposed scheme can improve the reconciliation efficiency and reduce the FER at a very low signal-to-noise ratio range, and it is more useful for a practical long-distance CV-QKD system.

APA, Harvard, Vancouver, ISO, and other styles

30

Izrailov, K. E. "Constant Values Distribution Investigation in the C Programs Source Code." Proceedings of Telecommunication Universities 10, no. 5 (2024): 118–28. http://dx.doi.org/10.31854/1813-324x-2024-10-5-118-128.

Full text

Abstract:

Currently, software engineering plays a key role in software development, one of the criteria for the development of which is the investigation of its factology and various scientific and practical patterns. An important aspect of this area is the logic of program execution, operating with internal data, and, in particular, constant values, the identification of patterns in which actualizes this research. The main applications of this pattern include obtaining fundamental knowledge about algorithms, creating new and expanding existing metrics for evaluating and comparing program code, developing methods for its optimization, using it in genetic programming, etc.The purpose of this article is to obtain the frequency distribution of constant values in the source code of programs in the C programming language.The essence of the presented approach is to create a method for statistical analysis of the text of the source codes of programs contained in the ExeBench dataset (which consists of a huge amount of source code of functions in the C programming language, their assembler code for various processor architectures, compilation errors and other information).The proposed method is based on the use of algorithms for lexical and syntactic analysis of source code functions, semantic definition of constant types, and conversion of the recording of programming language symbols into the corresponding numeric or string values.The method has an implementation in the form of a software tool in the Python programming language, given in the form of an intuitive pseudocode. Experiments using this prototype allowed us to obtain the desired distribution of constant values for the source code of programs in the C programming language. Analysis of the obtained results allowed us to make a number of important theoretical and practical conclusions regarding the most frequently used constants, the correspondence of the obtained distribution to the Zipf law and its proximity to the exponential function, the anomalous appearance of a number of constants in the Top 50, etc.The scientific novelty of the proposed approach lies in the fact that the distribution of constant values for the source code of programs in the C programming language is obtained for the first time.The theoretical significance consists in obtaining new fundamental knowledge regarding the features and patterns of source code constructions, which can be extended to other programming languages.The practical significance consists in applying the distribution to a wide range of tasks, including the author's genetic reverse engineering, which in itself is a qualitatively new direction.

APA, Harvard, Vancouver, ISO, and other styles

31

Ercolano, Barbara, Christopher Morisset, Michael J. Barlow, Xiao-wei Liu, and Peter J. Storey. "Three-Dimensional Monte Carlo Simulations of Ionised Nebulae." Symposium - International Astronomical Union 209 (2003): 397–98. http://dx.doi.org/10.1017/s0074180900209182.

Full text

Abstract:

A three-dimensional self-consistent photo-ionisation code is developed using Monte Carlo techniques in order to build realistic models of photoionised nebulae of arbitrary geometry and density distribution. The code's results are benchmarked against those of estabilished codes. Two models are computed for the planetary nebula NGC 3918 using two different density distributions. The results of the two models are compared with the observations.

APA, Harvard, Vancouver, ISO, and other styles

32

Chen, Shangdi, and Dawei Zhao. "Construction of Multi-receiver Multi-fold Authentication Codes from Singular Symplectic Geometry over Finite Fields." Algebra Colloquium 20, no. 04 (2013): 701–10. http://dx.doi.org/10.1142/s1005386713000679.

Full text

Abstract:

As an extension of the basic model of MRA-codes, multi-receiver multi-fold authentication codes can use a single key distribution phase for multiple message transmission. A multi-receiver multi-fold authentication code is constructed from the singular symplectic geometry over finite fields in this paper. The parameters and probabilities of success in impersonation and substitution attacks by malicious groups of receivers of this code are computed.

APA, Harvard, Vancouver, ISO, and other styles

33

Chao, Shih-Ho, Subhash C. Goel, and Soon-Sik Lee. "A Seismic Design Lateral Force Distribution Based on Inelastic State of Structures." Earthquake Spectra 23, no. 3 (2007): 547–69. http://dx.doi.org/10.1193/1.2753549.

Full text

Abstract:

It is well recognized that structures designed by current codes undergo large inelastic deformations during major earthquakes. However, lateral force distributions given in the seismic design codes are typically based on results of elastic-response studies. In this paper, lateral force distributions used in the current seismic codes are reviewed and the results obtained from nonlinear dynamic analyses of a number of example structures are presented and discussed. It is concluded that code lateral force distributions do not represent the maximum force distributions that may be induced during nonlinear response, which may lead to inaccurate predictions of deformation and force demands, causing structures to behave in a rather unpredictable and undesirable manner. A new lateral force distribution based on study of inelastic behavior is developed by using relative distribution of maximum story shears of the example structures subjected to a wide variety of earthquake ground motions. The results show that the suggested lateral force distribution, especially for the types of framed structures investigated in this study, is more rational and gives a much better prediction of inelastic seismic demands at global as well as at element levels.

APA, Harvard, Vancouver, ISO, and other styles

34

ACUNER, Deniz, Neşe ŞEKERCİ, Zehra Nur PAÇACI, Fatma Şeyma PAÇACI, and Aslıhan CEYHAN. "INVESTIGATION OF THE EFFECT OF THE COVID-19 PANDEMIC ON THE PSYCHOLOGICAL, SOCIAL AND EDUCATIONAL STATUS OF HIGH SCHOOL FINAL STUDENT PREPARING FOR THE UNIVERSITY ENTRANCE EXAM." IEDSR Association 6, no. 15 (2021): 183–97. http://dx.doi.org/10.46872/pj.340.

Full text

Abstract:

In this study, it is aimed to examine the effects of the Covid-19 Pandemic on the psychological, social and educational status of high school seniors preparing for the university entrance exam. In this context; In the 2020-2021 academic year, in-depth interviews were conducted with 15 students from different high school types who were studying in the last year of high school and preparing for the exam, in line with the semi-structured questionnaire, and the data obtained were descriptive analysis and content analysis (coding, code frequency and distribution, creation of themes, Calculation and mapping of relationships between subcodes and subcodes) were evaluated. Within the scope of the qualitative analysis, the effect of the pandemic process on the psychological, social and educational status of the students, a total of 422 codes in four different themes (The effects of the pandemic process on distance education - 131 codes, the effects on student behavior - 10 codes, the effects on students' emotions - 182 codes, concerns arising from the pandemic - 99 code) was created and analyzed. While the subjects that the students emphasized most frequently were “Lessons becoming inefficient” (25 codes), “Negative effects on motivation” (22 codes) and “Uncertainty anxiety” (20 codes), the least coded expression was “Happiness” (1 code). It has been determined that students preparing for the exam are generally negatively affected by the pandemic.

APA, Harvard, Vancouver, ISO, and other styles

35

Lago, Erik, Dany Sanchez Dominguez, and Leorlen Rojas Mazaíra. "Multiphysics Computational Modeling of Nuclear Reactors Small Size Through the Coupling of Serpent Codes and Fluent." Brazilian Journal of Radiation Sciences 12, no. 3 (2024): e2425. http://dx.doi.org/10.15392/2319-0612.2024.2425.

Full text

Abstract:

The study of nuclear energy using computational codes has been widely explored by nuclear engineering researchers through various calculations over the years, with emphasis on neutron and thermo-hydraulic calculations. The need for designing a reactor model that would produce energy at a lower cost per MWh highlighted the importance of Small Modular Reactor (SMR) reactors. Development: The present work aims to carry out a study related to the coupling of two computational codes, SERPENT and ANSYS FLUENT, using an SMR PWR reactor model (Pressurized Water Reactor) from the company B&W Generation, called mPower. Methods: The geometry of a pin of the mPower reactor was modeled and neutronics analyses of the model were performed using SERPENT code, while thermo-hydraulic analysis was simulated using FLUENT code. A coupling algorithm between these two simulation tools was built to automate the process of obtaining operational conditions for the effective operation of the reactor. Results: This work enabled the development of a tool that performs the multiphysics coupling between neutronic and thermos-hydraulic phenomena on mPower fuel pin. Conclusion: Multiphysics simulation, which considers the interaction between neutronic and thermal dynamics, provides an enhanced understanding of reactor operation. In this simulation, the power distribution generated by the neutronic code is used as input for the thermo-hydraulic code. Conversely, the temperature distribution obtained from the thermo-hydraulic simulation is fed back into a subsequent iteration of the neutronic analysis, thus achieving a coupling between these phenomena. To obtain accurate estimates for the power and temperature distributions, an automated process based on Python programming was implemented.

APA, Harvard, Vancouver, ISO, and other styles

36

Mhetre, Dr Nalini, Pratham Rajak, Shravani Deshmukh, Savani Khutale, and Mayuresh Pitambare. "E-Ration Distribution System Based on QR-Code." International Journal for Research in Applied Science and Engineering Technology 11, no. 5 (2023): 5459–62. http://dx.doi.org/10.22214/ijraset.2023.52366.

Full text

Abstract:

Abstract: Ration cards are essential for many households as they provide access to necessities such as food and fuel. However, the existing ration distribution system has one main drawback: fraudulence, where distributors sell materials to unauthorized customers. In this paper, we propose an E-Ration distribution system based on QR-code to address these issues. The proposed system uses QR-codes on ration cards, which when scanned provide details about the customer and distributor as well as the available ration. To implement the system, we develop an application that tracks the distribution of ration and logs its status. The application also allows for easy monitoring of stock levels and distribution records, which can be accessed by authorized personnel. This minimizes the human intervention as much as possible to make the system efficient and cost-effective.

APA, Harvard, Vancouver, ISO, and other styles

37

Abdulkhaleq, Nadhir Ibrahim, Faeza Abbas Abed, Ihsan Jabbar Hasan, and Falah Hasan Mahdi. "Improving the data recovery for short length LT codes." International Journal of Electrical and Computer Engineering (IJECE) 10, no. 2 (2020): 1972. http://dx.doi.org/10.11591/ijece.v10i2.pp1972-1979.

Full text

Abstract:

Luby Transform (LT) code is considered as an efficient erasure fountain code. The construction of the coded symbols is based on the formation of the degree distribution which played a significant role in ensuring a smooth decoding process. In this paper, we propose a new encoding scheme for LT code generation. This encoding presents a deterministic degree generation (DDG) with time hoping pattern which found to be suitable for the case of short data length where the well-known Robust Soliton Distribution (RSD) witnessed a severe performance degradation. It is shown via computer simulations that the proposed (DDG) has the lowest records for unrecovered data packets when compared to that using random degree distribution like RSD and non-uniform data selection (NUDS). The success interpreted in decreasing the overhead required for data recovery to the order of 25% for a data length of 32 packets.

APA, Harvard, Vancouver, ISO, and other styles

38

Nadhir, Ibrahim Abdulkhaleq, Abbas Abed Faeza, Jabbar Hasan Ihsan, and Hasan Mahdi Falah. "Improving the data recovery for short length LT codes." International Journal of Electrical and Computer Engineering (IJECE) 10, no. 2 (2020): 1972–79. https://doi.org/10.11591/ijece.v10i2.pp1972-1979.

Full text

Abstract:

Luby Transform (LT) code is considered as an efficient erasure fountain code. The construction of the coded symbols is based on the formation of the degree distribution which played a significant role in ensuring a smooth decoding process. In this paper, we propose a new encoding scheme for LT code generation. This encoding presents a deterministic degree generation (DDG) with time hoping pattern which found to be suitable for the case of short data length where the well-known Robust Soliton Distribution (RSD) witnessed a severe performance degradation. It is shown via computer simulations that the proposed (DDG) has the lowest records for unrecovered data packets when compared to that using random degree distribution like RSD and non-uniform data selection (NUDS). The success interpreted in decreasing the overhead required for data recovery to the order of 25% for a data length of 32 packets.

APA, Harvard, Vancouver, ISO, and other styles

39

Cho, Y. W., J. M. Kwon, K. Kim, et al. "Hybrid-gyrokinetic simulations of low-n toroidal Alfvén eigenmodes using gKPSP." Physics of Plasmas 29, no. 6 (2022): 062503. http://dx.doi.org/10.1063/5.0086570.

Full text

Abstract:

We report a benchmark study of toroidal Alfvén eigenmode (TAE) simulation using the hybrid-gyrokinetic code GyroKinetic Plasma Simulation Program (gKPSP). A simulation capability for energetic particles based on the gyrokinetic δf method has been newly implemented in the gKPSP code. Benchmark simulations have been performed in both circular and realistic tokamak geometries. Good agreement has been found with previously reported results, demonstrating the new capability of the gKPSP code. We have investigated the effects of the distribution function on TAE stability by examining both isotropic and anisotropic slowing-down distributions of energetic particles. The slowing-down distribution produces a higher linear growth rate than a Maxwellian distribution, while a growth rate scan with the anisotropy shows an opposite trend. This can be attributed to competition between Landau damping and the linear drive, which are correlated with the fraction of resonant passing particles and their distribution in phase space.

APA, Harvard, Vancouver, ISO, and other styles

40

Semenova, T., E. Mitenkova, and E. Solovyova. "FISSION MATRIX IN TDMCC CODE FOR LOOSELY COUPLED SYSTEMS CALCULATION." PROBLEMS OF ATOMIC SCIENCE AND TECHNOLOGY. SERIES: NUCLEAR AND REACTOR CONSTANTS 2019, no. 2 (2019): 31–37. http://dx.doi.org/10.55176/2414-1038-2019-2-31-37.

Full text

Abstract:

In loosely coupled systems the criticality calculations using the traditional Monte Carlo power generation methods can lead to incorrect effective multiplication factor and neutron distribution functions, which is largely due to the steady-state neutron source in system. In reactor systems, the power generation method ensures the correct neutron source formation with a proper eigenfunction for any initial neutron distributions. A traditional power generation method does not guarantee the adequate source formation in loosely coupled systems even under very large calculation statistics. To count the neutron distribution functions in loosely coupled systems in TDMCC code is implemented algorithm based on fission matrix. Its capabilities are demonstrated to count the fission rate distributions in loosely coupled system such a slab with extended inhomogeneous fuel zones.

APA, Harvard, Vancouver, ISO, and other styles

41

Liu, Yachen, Pengcheng Wang, Dehong Tian, Haixin Sun, Jie Qi, and Ruiping Song. "Research on Degree Distribution Optimization of LT Codes." Xibei Gongye Daxue Xuebao/Journal of Northwestern Polytechnical University 38, no. 3 (2020): 627–33. http://dx.doi.org/10.1051/jnwpu/20203830627.

Full text

Abstract:

LT code, as a channel coding scheme with good adaptability to the channel, has a stable performance in data transmission of underwater acoustic communication. In the case of large decoding overhead, the LT code can reach the ideal bit error rate(BER), but when the length of the encoded data is short, its coding and decoding performance is not ideal. LT code was applied to underwater acoustic communication by combining with orthogonal frequency division multiplexing (OFDM), and a LT-OFDM system was constructed. To improve the performance of LT code in the case of short code length, a method for degree distribution optimization was proposed on the objective of minimizing BER and minimizing average coding degree. Simulation and sea trial results show that under the same BER this method can optimize the system, transform 7%-22% conversion, and reduce the complexity of coding and decoding.

APA, Harvard, Vancouver, ISO, and other styles

42

Nadhir, Ibrahim Abdulkhaleq, Abdul Jalil Salih Nahla, Salih Mohammed Hasan Rajaa, and Jabbar Hasan Ihsan. "A Simulink model for modified fountain codes." TELKOMNIKA (Telecommunication, Computing, Electronics and Control) 21, no. 1 (2023): 18–25. https://doi.org/10.12928/telkomnika.v21i1.23274.

Full text

Abstract:

This paper introduces a Simulink model design for a modified fountain code. The code is a new version of the traditional Luby transform (LT) codes. The design constructs the blocks required for generation of the generator matrix of a limited-degree-hopping-segment Luby transform (LDHS-LT) codes. This code is especially designed for short length data files which have assigned a great interest for wireless sensor networks. It generates the degrees in a predetermined sequence but random generation and partitioned the data file in segments. The data packets selection has been made serialy according to the integer generated from both degree and segment generators. The code is tested using Monte Carlo simulation approach with the conventional code generation using robust soliton distribution (RSD) for degree generation, and the simulation results approve better performance with all testing parameter.

APA, Harvard, Vancouver, ISO, and other styles

43

Jiang, Wei, and Jun Jie Yang. "A Degree Distribution Optimization Algorithm in Unequal-Protected LT Code." Applied Mechanics and Materials 599-601 (August 2014): 1313–16. http://dx.doi.org/10.4028/www.scientific.net/amm.599-601.1313.

Full text

Abstract:

LT code is the first practical implementation of digital fountain code. The coding behavior of LT code is mainly decided by the degree distribution which determines the relationship between source data and codeword. Since coding systems with unequal loss protection are widely applied, a degree distribution optimization algorithm is designed for unequal-protected LT code. The degree distribution that minimizes the number of un-recovered source symbols is found. By introducing the weighted cost, the optimal degree distribution can be solved by evolutionary strategy. The experimental results are quite promising. Compared with LT code with robust soliton distribution, the proposed algorithm improves the number of the recovered symbols obviously with the same overhead.

APA, Harvard, Vancouver, ISO, and other styles

44

Grivas, Christopher, Abraham Ifrah, Nikita Dahake, et al. "FIT as a population-based and financially viable method to screen underserved patients for colorectal cancer." Journal of Clinical Oncology 42, no. 16_suppl (2024): e13516-e13516. http://dx.doi.org/10.1200/jco.2024.42.16_suppl.e13516.

Full text

Abstract:

e13516 Background: Temple University Hospital (TUH) created an initiative to increase colorectal cancer (CRC) screening by administering fecal immunochemical tests (FIT) to the underserved population of Philadelphia. We hypothesize that this will increase the percentage of diagnostic colonoscopies performed compared to baseline in our fixed capacity colonoscopy suite and ultimately generate a higher reimbursement per colonoscopy. This potential revenue increase can help fund the infrastructure to administer a large quantity of FIT tests to the community and create a truly equitable population-based approach to CRC screening. Methods: 27,169 colonoscopies and their associated CPT codes from 2017-2022 performed at TUH were analyzed. 16 individual CPT codes were identified and categorized as either screening or diagnostic CPT codes. Reimbursement for each of the CPT codes was determined by the Medicare reimbursement per CPT code and used to determine the average reimbursement per screening CPT code and average reimbursement per diagnostic CPT code. A Monte Carolo simulation model was created using Palisades @Risk software to compare the reimbursements of FIT test prompted vs. non-FIT test prompted colonoscopies over a range of possible distributions of diagnostic CPT codes. Monte Carlo simulations model scenarios that incorporate uncertainties with the objective of providing a distribution of outcomes from the least likely to most likely outcomes. Results: The historical distribution of screening vs. diagnostic CPT codes at TUH is 31% and 69%, respectively, with an average Medicare reimbursement of $2,668 per colonoscopy. We have distributed 292 FIT tests, and 5 FIT test prompted colonoscopies have been completed with 7 associated CPT codes. The preliminary distribution of screening CPT codes vs diagnostic CPT codes is 29% and 71%, respectively, with an average reimbursement of $2,691. Lastly, we used a Monte Carlo simulation to run 10 separate simulations with 5000 iterations each to show the most likely reimbursement rates over a possible distribution of diagnostic colonoscopies (Table). Conclusions: Our preliminary data suggests FIT testing can offer three main benefits: 1) Expansion of the number of patients receiving CRC screening; 2) triage optimization of the fixed capacity colonoscopy suite by performing more diagnostic colonoscopies than screening colonoscopies to diagnose more colorectal pathologies; and 3) funding for a population based FIT testing campaign by utilizing the Medicare reimbursement delta from screening to diagnostic colonoscopies. [Table: see text]

APA, Harvard, Vancouver, ISO, and other styles

45

Fan, Guochao, Chengdong Xu, Jing Zhao, and Xueen Zheng. "A distribution model of the GNSS code noise and multipath error considering both elevation angle and orbit type." Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering 233, no. 5 (2018): 1900–1915. http://dx.doi.org/10.1177/0954410018765561.

Full text

Abstract:

Commonly, the code noise and multipath error is considered to fully obey the Gaussian distribution. While in the cases with different elevation angles and orbit types, the assumption may be inappropriate. Based on an empirical study, by considering both the elevation angle and the orbit type, a new code noise and multipath distribution model is proposed to describe a more accurate code noise and multipath distribution in this paper. Actual code noise and multipath data from 10 observation stations during two months are researched, and the parameters and elevation angle range of code noise and multipath distribution model are determined. The code noise and multipath distribution model is verified to be more accurate than the model presented in the Global Navigation Satellite System Evolutionary Architecture Study report, according to the analysis on the code noise and multipath overbounding, position error overbounding, and the availability of receiver autonomous integrity monitoring. This model provides more accurate prior information for receiver autonomous integrity monitoring, especially its availability.

APA, Harvard, Vancouver, ISO, and other styles

46

Ming-hu, Wu, and Zhu Xiu-chang. "A Video Code Based on Distribution Compressive Sensing." Procedia Engineering 29 (2012): 3613–18. http://dx.doi.org/10.1016/j.proeng.2012.01.540.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

GUO, YING, and GUIHUA ZENG. "DETERMINISTIC QUANTUM KEY DISTRIBUTION USING STABILIZER QUANTUM CODE." International Journal of Quantum Information 05, no. 03 (2007): 319–34. http://dx.doi.org/10.1142/s0219749907002888.

Full text

Abstract:

Employing a stabilizer quantum code (SQC), a quantum deterministic communication scheme is proposed to transmit secret messages with unconditional security. The proposed scheme has great capacity to transmit the messages since the utilized SQC can encode more than one qubit of the secret message in the message transmission phase for one scheme run. By utilizing the syndromes of the destroyed qubits, the damaged states can be exactly recovered from the received travel photons, which means that the scheme can be implemented in the imperfect channel with high fidelity.

APA, Harvard, Vancouver, ISO, and other styles

48

Zhou, Yuezhi, Yaoxue Zhang, and Jianhua Lu. "CDS: a code distribution scheme for active networks." Computer Communications 27, no. 3 (2004): 315–21. http://dx.doi.org/10.1016/s0140-3664(03)00237-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Park, Jaesang, and Byung-In Kim. "Classification code assignment for a parcel distribution network." Computers & Industrial Engineering 144 (June 2020): 106447. http://dx.doi.org/10.1016/j.cie.2020.106447.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

El-Shazly, M. N., A. V. Tikhomirov, G. G. Gulbekian, and P. Kováě. "GENAP—the code for a pressure distribution calculation." Vacuum 52, no. 4 (1999): 401–5. http://dx.doi.org/10.1016/s0042-207x(98)00318-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Code distribution'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles