Log in

Relevant bibliographies by topics / Code distribution

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Code distribution'

Author: Grafiati

Published: 3 June 2025

Last updated: 23 June 2025

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Code distribution.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Code distribution"

1

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

Full text

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

More sources

Dissertations / Theses on the topic "Code distribution"

1

Pazat, Jean-Louis. "Génération de code réparti par distribution de données." Habilitation à diriger des recherches, Université Rennes 1, 1997. http://tel.archives-ouvertes.fr/tel-00170867.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Pazat, Jean-Louis. "Génération de code réparti par distribution de données." [S.l.] : [s.n.], 1997. ftp://ftp.irisa.fr/techreports/habilitations/pazat.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Hollinger, Kenneth B. "Code optimization for the Choi-Williams distribution for ELINT applications." Thesis, Monterey, California : Naval Postgraduate School, 2009. http://edocs.nps.edu/npspubs/scholarly/theses/2009/Dec/09Dec%5FHollinger.pdf.

Full text

Abstract:

Thesis (M.S. in Electrical Engineering)--Naval Postgraduate School, December 2009.<br>Thesis Advisor(s): Fouts, Douglas J. ; Pace, Phillip E. "December 2009." Description based on title screen as viewed on January 27, 2010. Author(s) subject terms: Choi-Williams Distribution, Signal Processing, Algorithm Optimization, C programming, Low Probability of Intercept (LPI), Radar detection, Radar classification. Includes bibliographical references (p. 75-76). Also available in print.

APA, Harvard, Vancouver, ISO, and other styles

4

Kamfor, Michael. "Robustesse et spectroscopie du code torique dans un champ magnétique." Paris 6, 2013. http://www.theses.fr/2013PA066113.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Melin, Emmanuel. "Traitement de l'irregularite dans la parallelisation de code sequentiel par distribution des donnees." Orléans, 1998. http://www.theses.fr/1998ORLE2018.

Full text

Abstract:

Cette these est consacree a l'etude d'un modele cible pour la traduction de code sequentiel en code parallele. Les approches classiques de la parallelisation automatique impliquent l'analyse exacte des dependances de donnees entre les operations. L'experience a montre que cette methode est souvent inefficace dans le cas des calculs sur objets irreguliers. Le principe de la resolution dynamique des acces offre une reponse simple pour la traduction de code presentant des acces irreguliers aux donnees. Toutefois, dans les approches classiques, les performances sont limitees par le modele de communication. Nous proposons une methode de traduction reprenant le principe de la resolution dynamique des acces. Notre approche consiste a structurer les programmes de telle sorte que les informations de dependances et d'independances entre les instructions soient representees par la syntaxe. Les synchronisations sont basees sur l'attente de signaux diffusant des compteurs multi niveaux, les horloges structurelles. Les acces en memoire distante sont diriges par la structure syntaxique du programme. Nous proposons un langage dont la machine abstraite est basee sur le modele precedent de synchronisation et de communication. Les lectures en memoire distante dirigees par la syntaxe permettent d'eviter les synchronisations globales lors de la traduction de codes sequentiels. Lorsqu'une analyse de dependance, meme partielle, est praticable on peut remplacer les acces en memoire distante par des envois de messages. Le modele de synchronisation dirige par la syntaxe permet alors d'eviter le parcours de toutes les structures de controle par tous les indices. Nous montrons qu'il est possible de valider formellement l'approche. Nous terminons en donnant des exemples de programmes parallelises selon notre methode et en comparant leurs performances avec celles de programmes parallelises suivant des approches plus classiques.

APA, Harvard, Vancouver, ISO, and other styles

6

Leydold, Josef, Gerhard Derflinger, Günter Tirler, and Wolfgang Hörmann. "An Automatic Code Generator for Nonuniform Random Variate Generation." Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business, 2001. http://epub.wu.ac.at/364/1/document.pdf.

Full text

Abstract:

There exists a vast literature on nonuniform random variate generators. Most of these generators are especially designed for a particular distribution. However in pratice only a few of these are available to practioners. Moreover for problems as (e.g.) sampling from the truncated normal distribution or sampling from fairly uncommon distributions there are often no algorithms available. In the last decade so called universal methods have been developed for these cases. The resulting algorithms are fast and have properties that make them attractive even for standard distributions. In this contribution we describe the concept of Automatic random variate generation where these methods are used to produce a single piece of code in a high level programming language. Using a web-based front-end to such a program this is an easy-to-use source for researchers and programmers for high quality generators for a large class of distributions. Using our UNURAN library we have implemented such a system, which is accessable at <a href="http://statistik.wu-wien.ac.at/anuran" target="_blank">http://statistik.wu-wien.ac.at/anuran</a>.<br>Series: Preprint Series / Department of Applied Statistics and Data Processing

APA, Harvard, Vancouver, ISO, and other styles

7

Singh, Neeta S. "An automatic code generation tool for partitioned software in distributed computing." [Tampa, Fla.] : University of South Florida, 2005. http://purl.fcla.edu/fcla/etd/SFE0001129.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Qian, Liqin. "Contributions to the theory of algebraic coding on finite fields and rings and their applications." Electronic Thesis or Diss., Paris 8, 2022. http://www.theses.fr/2022PA080064.

Full text

Abstract:

La théorie du codage algébrique sur les corps et les anneaux finis a une grande importance dans la théorie de l'information en raison de leurs diverses applications dans les schémas de partage de secrets, les graphes fortement réguliers, les codes d'authentification et de communication. Cette thèse aborde plusieurs sujets de recherche selon les orientations dans ce contexte, dont les méthodes de construction sont au cœur de nos préoccupations. Plus précisément, nous nous intéressons aux constructions de codes optimaux (ou codes asymptotiquement optimaux), aux constructions de codes linéaires à "hull" unidimensionnelle, aux constructions de codes minimaux et aux constructions de codes linéaires projectifs. Les principales contributions sont résumé comme suit. Cette thèse fournie une description explicite des caractères additifs et multiplicatifs sur les anneaux finis (précisément S\mathbb{F}_q+u\mathbb{F}_q~(u^2= 0)S et _\mathbb{F} _q +u\mathbb{F}_q~(u^2=u)s), utilise des sommes Gaussiennes, hyper Eisenstein et Jacobi et fournit plusieurs classes de nouveaux codes optimaux (ou asymptotiquement optimaux) avec des paramètres flexibles, propose des codes linéaires (optimaux ou quasi-optimal) avec une "hull" unidimensionnelle sur des corps finis en utilisant des outils de la théorie de la somme Gaussienne. De plus, cette thèse explore plusieurs classes de codes linéaires binaires (optimaux pour la borne de Griesmer bien connue) sur des corps finis basés sur deux constructions génériques utilisant des fonctions. Aussi, elle détermine leurs paramètres et leurs distributions de poids et en déduit plusieurs familles infinies de codes linéaires minimaux. Enfin, elle étudie des constructions optimales de plusieurs classes de codes linéaires binaires projectifs avec peu de poids et leurs codes duaux correspondants<br>Algebraic coding theory over finite fields and rings has always been an important research topic in information theory thanks to their various applications in secret sharing schemes, strongly regular graphs, authentication and communication codes.This thesis addresses several research topics according to the orientations in this context, whose construction methods are at the heart of our concerns. Specifically, we are interested in the constructions of optimal codebooks (or asymptotically optimal codebooks), the constructions of linear codes with a one-dimensional hull, the constructions of minimal codes, and the constructions of projective linear codes. The main contributions are summarized as follows. This thesis gives an explicit description of additive and multiplicative characters on finite rings (precisely _\mathbb{F}_q+u\mathbb{F}_q~(u^2= 0)s and S\mathbb{F}_q+u\mathbb{F}_q~(u^2=u)S), employees Gaussian, hyper Eisenstein and Jacobi sums and proposes several classes of optimal (or asymptotically optimal) new codebooks with flexible parameters. Next, it proposes(optimal or nearly optimal) linear codes with a one-dimensional hull over finite fields by employing tools from the theory of Gaussian sums. It develops an original method to construct these codes. It presents sufficient conditions for one-dimensional hull codes and a lower bound on its minimum distance. Besides, this thesis explores several classes of (optimal for the well-known Griesmer bound) binary linear codes over finite fields based on two generic constructions using functions. It determines their parameters and weight distributions and derives several infinite families of minimal linear codes. Finally, it studies (optimal for the sphere packing bound) constructions of several classes of projective binary linear codes with a few weight and their corresponding duals codes

APA, Harvard, Vancouver, ISO, and other styles

9

Planells-Rodríguez, Milena. "Modélisation des erreurs en sortie du décodeur dans une chaîne de transmission par satellite." Paris, ENST, 2003. http://www.theses.fr/2003ENST0023.

Full text

Abstract:

Cette thèse traite du comportement des erreurs en sortie du decodeur dans une chaîne de transmission par satellite. Deux types de codage canal sont étudiés: la concaténation d'un code convolutif avec un code bloc Reed-Solomon, et la concaténation en parallèle de deux codes convolutifs avec décodage itératif (turbocode). L'algorithme utilisé pour le décodage convolutif dans le premier schéma est le maximum de vraisemblance, que l'on appelle aussi algorithme de Viterbi. On sait que les erreurs en sortie de cet algorithme apparaissent par rafales, à cause de la mémoire du code. Un groupe de bits décodés correctement entre deux rafales est appelé gap. La sortie d'un décodeur fondé sur le maximum de vraisemblance peut être modélisée par une chaîne de Markov à deux états: un premier état sans erreur (état bon) et un deuxième état où les erreurs surgissent par rafales (état mauvais). Concernant la modélisation des rafales d'erreurs, les modèles proposés jusqu'à maintenant sont capables de reproduire seulement le comportement des erreurs pour des rafales très longues et à de très faible rapport signal sur bruit. C'est pourquoi nous avons développé un nouveau modèle à partir des propriétés du code qui donne des très bons résultats pour n'importe quel longueur de rafale d'erreur. Dans le déuxième schéma de codage, on utilise des algorithmes itératifs. Ces algorithmes font appel au principe du Maximum A Posteriori (MAP). Cette thèse analyse le comportement des erreurs en sortie de ces décodeurs itératifs et propose une série de modèles pour des differents algorithmes (Log-MAP et Max-Log-MAP)<br>This dissertation studies the behavior of the errors at the output of the decoder on a satellite communication system. Two different types of channel coding are considered. On one hand, a classical concatenation of a Reed-Solomon with a convolutional code and interleaving. On the other hand, a code from the turbo-codes family. The algorithm used in the convolutional decoding of the first coding system is the maximum likelihood algorithm. It is known that errors at the output of this algorithm are grouped in bursts due to the memory of the code. The group of correct bits between bursts is called a gap. Thus, the output of a maximum likelihood decoder can be modeled by a Markov chain with two states: a first state where no errors take place (good state) and a second state where errors appear in bursts (bad state). Regarding the burst modeling, the previous proposed models did not fit the simulation results for low and average burst lengths. Therefore, we have developed a new model based on the properties of the code that fits the range of all possible bursts lengths. On the second coding system, instead of using a maximum likelihood decoding, iterative decoding based on the successive decoding of each constituent code is considered. These iterative decoding algorithms are based on the Maximum A Posteriori (MAP) principle. This dissertation analyses the behavior of the errors at the output of such iterative decoders and proposes a model that fits quite well with the real errors simulated via Monte Carlo simulations

APA, Harvard, Vancouver, ISO, and other styles

10

Boffa, Francesco. "A Vlasov-hybrid code with Hermite expansion of the distribution function for the study of low growth rate instabilities." Thesis, Queen Mary, University of London, 2018. http://qmro.qmul.ac.uk/xmlui/handle/123456789/53943.

Full text

Abstract:

Within turbulence there are many phenomena which are currently unsolved. In the solar wind temperature anisotropies and low growth rates instability have a dominant role in defining the turbulent behaviour of plasma. Due to the non- linearity of the equations involved in the description of the physics of plasmas numerical simulations are a fundamental tool to study the dynamics of turbulent phenomena. In particular, hybrid codes are widely used in space plasma applications due to their ability to simulate large regions of volume maintaining some kinetic effects. However, due to the sensitivity to the initial level of noise in the simulation, low growth rate instabilities are particularly difficult to simulate. Particle in Cell-hybrid simulations require too many particles to reduce the initial noise, while Vlasov-hybrid simulations require too many grid points to fully discretize spatial and velocity phase spaces. We present here a Vlasov-hybrid algorithm and code implementation where the distribution function is expanded in series of Hermite functions. Thanks to the properties of these it is possible to project the Vlasov equation to find an equation for each coefficient of the expansion. These coefficients are advanced in time using a Current Advance Method algorithm with splitting method for the Vlasov operator. The former is treated explicitly, while the latter is treated implicitly with a GMRES solver. The current is advanced with a temporal ODE derived taking moments of the Vlasov equation. A 1D3V code is implemented, tested and used to study low growth rate instabilities such as a proton cyclotron instability and a ion/ion right hand resonant instability with small relative velocity drift between beam and core populations. The results are compared with existing hybrid algorithms that we implemented. A 2D3V parallelized version of the code is implemented and described here. Initial results are presented and future improvements are discussed.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Code distribution"

1

Chartered Institution of Building Services Engineers., ed. Water distribution systems: Commissioning code : code W: 1994. Chartered Institution of Building Services Engineers, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

United States. National Aeronautics and Space Administration., ed. NPAC--nozzle performance analysis code. National Aeronautics and Space Administration, 1997.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Chemical Manufacturers Association (U.S.), ed. A Guide to the distribution code of management practices. Chemical Manufacturers Association, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Center, Langley Research, ed. Utilities for master source code distribution: MAX and friends. National Aeronautics and Space Administration, Langley Research Center, 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Food and Agriculture Organization of the United Nations., ed. International code of conduct on the distribution and use of pesticides. Food and Agriculture Organization of the United Nations, 1986.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Canadian Council of Ministers of the Environment. and Canadian Council of Ministers of the Environment. National Task Force on Vapour Recovery in Gasoline Distribution Networks., eds. Environmental code of practice for vapour recovery in gasoline distribution networks. Canadian Council of Ministers of the Environment, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Food and Agriculture Organization of the United Nations., ed. International code of conduct on the distribution and use of pesticides. Food and Agriculture Organization of the United Nations, 1986.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

IEEE Power Engineering Society. Transformers Committee., Institute of Electrical and Electronics Engineers., and IEEE Standards Board, eds. IEEE standard test code for dry-type distribution and power transformers. Institute of Electrical and Electronics Engineers, 2001.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

W, Kessler Christoph, ed. Automatic parallelization: New approaches to code generation, data distribution, and performance prediction. Vieweg, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Keßler, Christoph W. Automatic Parallelization: New Approaches to Code Generation, Data Distribution, and Performance prediction. Vieweg+Teubner Verlag, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Code distribution"

1

Donovan, Peter, and John Mack. "The Scanning Distribution." In Code Breaking in the Pacific. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08278-3_15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Schroeder, Doris, and David Robinson. "The PREPARED Code: A Global Code of Conduct for Research During Pandemics." In SpringerBriefs in Research and Innovation Governance. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-91324-2_2.

Full text

Abstract:

Abstract This chapter presents the 27 articles of the PREPARED Code: A Global Code of Conduct for Research during Pandemics. Illustrative diagrams capture essential features of its development (e.g. the geographical distribution of the authors) and structure (e.g. that it is built around fairness, respect, care and honesty).

APA, Harvard, Vancouver, ISO, and other styles

3

Parsa, Saeed, and Vahid Khalilpoor. "Automatic Distribution of Sequential Code Using JavaSymphony Middleware." In SOFSEM 2006: Theory and Practice of Computer Science. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11611257_42.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Jalali-Sohi, Mehrdad, Rigobert Foka, Gaël Hachez, and Alexander Beitlich. "An Integrated Secure Web Architecture For Protected Mobile Code Distribution." In Communications and Multimedia Security Issues of the New Century. Springer US, 2001. http://dx.doi.org/10.1007/978-0-387-35413-2_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Li, Weijia, Youtao Zhang, and Bruce Childers. "MCP: An Energy-Efficient Code Distribution Protocol for Multi-Application WSNs." In Distributed Computing in Sensor Systems. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02085-8_19.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

De Wachter, Bram, Thierry Massart, and Cédric Meuter. "dSL: An Environment with Automatic Code Distribution for Industrial Control Systems." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-27860-3_14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

De Wachter, Bram, Alexandre Genon, and Thierry Massart. "From Static Code Distribution to More Shrinkage for the Multiterminal Cut." In Experimental and Efficient Algorithms. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11427186_17.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Xie, Yuxi, Hanbo Deng, Lizhi Peng, and Zhenxiang Chen. "Accurate Identification of Internet Video Traffic Using Byte Code Distribution Features." In Algorithms and Architectures for Parallel Processing. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-05051-1_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Rowe, Jonathan E., and Džena Hidović. "An Evolution Strategy Using a Continuous Version of the Gray-Code Neighbourhood Distribution." In Genetic and Evolutionary Computation – GECCO 2004. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24854-5_74.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Liu, Meilin, Qingfeng Zhuge, Zili Shao, Chun Xue, Meikang Qiu, and Edwin H. M. Sha. "Loop Distribution and Fusion with Timing and Code Size Optimization for Embedded DSPs." In Embedded and Ubiquitous Computing – EUC 2005. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11596356_15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Code distribution"

1

Yuan, Yaqi, Tianchen Xiao, Yubin Chen, and Qingqing Wu. "Research of LT Code Degree Distribution Based on Joint Degree Distribution." In 2024 5th International Conference on Computer Engineering and Intelligent Control (ICCEIC). IEEE, 2024. https://doi.org/10.1109/icceic64099.2024.10775956.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Ali, Shahnoor, and Neel Kanth Kundu. "Quantum code division multiple access based continuous-variable quantum key distribution." In 2025 International Conference on Quantum Communications, Networking, and Computing (QCNC). IEEE, 2025. https://doi.org/10.1109/qcnc64685.2025.00105.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Sumi, Takenori, Yukimasa Nagai, Jianlin Guo, and Hiroshi Mineno. "Firmware Distribution with Erasure Code for IoT applications on IEEE 802.15.4g Mesh Network." In 2024 IEEE 29th Asia Pacific Conference on Communications (APCC). IEEE, 2024. https://doi.org/10.1109/apcc62576.2024.10767985.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Hu, Qiang, Yuejun Guo, Xiaofei Xie, et al. "CodeS: Towards Code Model Generalization Under Distribution Shift." In 2023 IEEE/ACM 45th International Conference on Software Engineering: New Ideas and Emerging Results (ICSE-NIER). IEEE, 2023. http://dx.doi.org/10.1109/icse-nier58687.2023.00007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Dykstra, Dave. "Using CVMFS for User Analysis Code Distribution." In Using CVMFS for User Analysis Code Distribution. US DOE, 2019. https://doi.org/10.2172/2553990.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Lima, Phyllipe, Eduardo Guerra, and Paulo Meirelles. "Towards Visualizing Code Annotations Distribution." In Computer on the Beach. Universidade do Vale do Itajaí, 2020. http://dx.doi.org/10.14210/cotb.v11n1.p277-284.

Full text

Abstract:

Java developers make extensive use of code annotations sincetheir introduction in version 5 of the language. They areinserted directly on the source code for custom metadata configuration,similar to C# attributes. The software engineeringcommunity has few works investigating their usage and impacton source code. Being able to visualize characteristics ofcode annotations might aid developers in detecting potentialmisuse, outliers as well as increase the comprehensibility andreadability of the source code. In this paper, we present anapproach to use software metrics to generate a 2D polymetricview targeting the visualization of code annotations in Javaclasses. We developed a prototype tool using the Unity GameEngine. It displays classes and packages as rectangles andannotations as circles. We demonstrated the tool with a smallsample Java program.

APA, Harvard, Vancouver, ISO, and other styles

7

Wheeler, Amy, and Dave Binkley. "Subclass Instantiation Distribution." In 2010 10th IEEE Working Conference on Source Code Analysis and Manipulation (SCAM). IEEE, 2010. http://dx.doi.org/10.1109/scam.2010.12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Sun, Junding, and Xiaosheng Wu. "Chain Code Distribution-Based Image Retrieval." In 2006 International Conference on Intelligent Information Hiding and Multimedia. IEEE, 2006. http://dx.doi.org/10.1109/iih-msp.2006.264973.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Tuson, P., M. Roos, J. Wright, and G. Chown. "A Grid Code for Rwanda." In 22nd International Conference and Exhibition on Electricity Distribution (CIRED 2013). Institution of Engineering and Technology, 2013. http://dx.doi.org/10.1049/cp.2013.0533.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Guerrero, R. "Grid code interrelation, wind generation evolution and reactive compensation, special topics inside a grid code." In CIRED 2012 Workshop: Integration of Renewables into the Distribution Grid. IET, 2012. http://dx.doi.org/10.1049/cp.2012.0788.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Code distribution"

1

Cox, Lawrence J., and Scott D. Matthews. MCNP6(TM) Release 1.0: Creating and Testing the Code Distribution. Office of Scientific and Technical Information (OSTI), 2013. http://dx.doi.org/10.2172/1082231.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Cox, Lawrence J., and Laura Casswell. MCNP(TM) Release 6.1.1 beta: Creating and Testing the Code Distribution. Office of Scientific and Technical Information (OSTI), 2014. http://dx.doi.org/10.2172/1134769.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Reece, W. D., S. D. Miller, and J. S. Durham. SADDE (Scaled Absorbed Dose Distribution Evaluator): A code to generate input for VARSKIN. Nuclear Regulatory Commission, Washington, DC (USA). Div. of Accident Evaluation; Pacific Northwest Lab., Richland, WA (USA), 1989. http://dx.doi.org/10.2172/6538281.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Shires, Theresa M., and Matthew R. Harrison. GRI-98-0367.1 Development of the B31.8 Code and Federal Pipeline Safety Regulations. Pipeline Research Council International, Inc. (PRCI), 1998. http://dx.doi.org/10.55274/r0011812.

Full text

Abstract:

This report documents the intentions and founding principles of the ASME B3 l .8 Gas Transmission and Distribution Piping Systems Codes and the Pipeline Safety Regulations (Title 49 Code of Federal Regulations Part 192). Two meetings were held with distinguished pipeline experts and the first directors of the Office of Pipeline Safety to provide background information on the development of the Codes and Regulations. The focus of this effort was natural gas transmission pipeline operations. This report also addresses five major topics of interest to the U.S. transmission pipeline industry: establishing the threshold for operating pressure, class location areas, valve spacing, inspection frequencies, and public communications. Through an understanding of the Code and regulatory foundations, the pipeline industry can more effectively interpret and apply the requirements and recommendations to today's natural gas pipelines. In addition, the industry can use this information to support continued public benefit, improved safety, and industry growth.

APA, Harvard, Vancouver, ISO, and other styles

5

Hill, Christian. International Atomic and Molecular Code Centres Network: Virtual Atomic and Molecular Data Centres Consortium Annual Meeting. International Atomic Energy Agency, 2023. http://dx.doi.org/10.61092/iaea.s57n-ra6p.

Full text

Abstract:

The International Code Centres Network (CCN) is a group of experts developing codes and models for atomic, molecular and plasma-surface interaction data relevant to fusion applications. Variable subsets of the group are brought together by the IAEA Atomic and Molecular Data (AMD) Unit in order to discuss computational and scientific issues associated with code developments. At the 8th Technical Meeting described in this report, which was held virtually from 15 – 17 November 2023, 31 experts in the field of atomic and molecular physics met, representing 23 databases within the Virtual Atomic and Molecular Data Centres (VAMDC) Consortium. The VAMDC brings together research institutions that share a common technical and political framework for the distribution and curation of atomic and molecular data; this virtual meeting was its annual meeting at which priorities for data and software infrastructure development are planned and membership within the collaboration for the coming year established.

APA, Harvard, Vancouver, ISO, and other styles

6

DeLima, Henry, Joe Akin, and Joseph Pietsch. High Efficiency Integrated Space Conditioning, Water Heating and Air Distribution System for HUD-Code Manufactured Housing. Office of Scientific and Technical Information (OSTI), 2008. http://dx.doi.org/10.2172/1051562.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Slater, Simon. PR337-23115-R01 Consensus Engineering Requirements for Pipelines in Hydrogen and Hydrogen Blend Service. Pipeline Research Council International, Inc. (PRCI), 2024. http://dx.doi.org/10.55274/r0000084.

Full text

Abstract:

In June 2023, the American Society of Mechanical Engineers (ASME) Board of Pressure Technology Codes and Standards approved a plan to modify the location and content of hydrogen pipelines within their code. The decision was made to relocate the hydrogen pipeline sections of ASME B31.12 Hydrogen Piping and Pipelines to a new exception chapter within ASME B31.8 Gas Transmission and Distribution Piping Systems. Along with this move, the technical content was also to be updated to reflect current best practices. The Pipeline Research Council International (PRCI) established the Emerging Fuels Institute (EFI) in 2020 to advance research and improve code language related to carbon dioxide, hydrogen, renewable natural gas, and other emerging fuels. In response to ASME's decision, EFI developed a project to create Consensus Engineering Requirements (CERs) for hydrogen pipeline design and reuse. The work contained in this document will serve as the starting point for discussion within the ASME B31.8 Hydrogen Task Group that has the responsibility to write the new exception chapter of ASME B31.8 Gas Transmission and Distribution Piping Systems. The CERs are presented within this report, alongside a Nonmandatory Appendix that provides user guidance, and a rationale document that includes justification and supporting information for new requirements. The three documents are based on the latest state-of-the-art research related to pipeline transport of gaseous hydrogen and hydrogen blend service.

APA, Harvard, Vancouver, ISO, and other styles

8

Zhai, Fan, Thomas Hertel, and Zhi Wang. Labor Market Distortions, Rural-Urban Inequality and the Opening of China’s Economy. GTAP Working Paper, 2003. http://dx.doi.org/10.21642/gtap.wp27.

Full text

Abstract:

This paper evaluates the impact of some key labor market reforms on rural-urban inequality and income distribution, using a household-disaggregated, recursive dynamic computable general equilibrium (CGE) model of China. We also explore how these factor market reforms interact with product market reforms currently underway as part of China’s WTO accession process. The simulation results show that the reforms in rural land rental market and Hukou system, as well as increasing off-farm labor mobility would reduce the urban-rural income ratio dramatically. Furthermore, the combination of WTO accession and factor market reforms improves both efficiency and equality significantly. Keywords: Labor market, Income distribution, WTO, Computable general equilibrium, China JEL Classification Code: C68; J60; D30; F13; O53

APA, Harvard, Vancouver, ISO, and other styles

9

Barlo, Thomas. L51502 Investigation of Side-Drain Potential for Cathodic Protection of Bare Pipelines. Pipeline Research Council International, Inc. (PRCI), 1986. http://dx.doi.org/10.55274/r0011425.

Full text

Abstract:

The objectives of this research are: - To determine the relationships between ground-level potential distribution and net cathodic current picked up on a bare pipeline, and - To verify those findings in the field. The research was conducted in two tasks. In Task 1, computer code calculations were performed for selected conditions to examine the relation between ground-level potentials and the current direction and magnitude at the pipe surface for cathodic protection current impressed on a bare pipeline from a distributed-anode, or remote-anode system. In Task 2, measurements were made on a 20-inch diameter bare pipeline in Charleston, West Virginia, and a 10-inch diameter bare pipeline near Hurricane, West Virginia to verify the computer code calculations.

APA, Harvard, Vancouver, ISO, and other styles

10

Tow Leong, Tiang, Mohd Saufi Ahmad, Ang Qian Yee, et al. HANDBOOK OF ELECTRICAL SYSTEM DESIGN FOR NON-DOMESTIC BUILDING. Penerbit Universiti Malaysia Perlis, 2023. http://dx.doi.org/10.58915/techrpt2023.001.

Full text

Abstract:

This technical report presents the electrical system installation design for development of a factory with 1 storey and 2 storey of offices. Firstly, the general methodology of designing the electrical system are elaborated in this report. As overall, the methodologies in designing the components of the electrical system are explained and elaborated, which included: (a) load and maximum demand estimation; (b) miniature circuit breaker (MCB) selection; (c) moulded case circuit breaker (MCCB) selection; (d) air circuit breaker (ACB) selection, (e) residual current device (RCD) selection; (f) protection relay selection; (g) current transformer (CT) selection; (h) sizing selection for cable and live conductors; (i) capacitor bank selection for power factor correction (PFC); and (j) distribution transformer and its protection devices selection. Then, the electrical system of this project is computed and designed by using the methodologies aforementioned. Firstly, the electrical system of various distribution boards (DBs) with the protection/metering devices along with its phase and earthing cables for every final circuits are designed and installed in the factory. Next, the installation is proceeded with the electrical system of main switchboard (MSB) with the protection/metering devices along with its phase and earthing cables for every DBs. Also, the electrical system of PFC by using detuned capacitor bank with various protection/metering devices is designed and built in the plant. Apart from that, the factory is equipped with the electrical system of high tension (HT) room that included the distribution power transformer with the protection/metering devices along with its phase and earthing cables. Lastly, the methodologies and the computation design of the electrical system installation in the context of connected load, load currents, maximum demand, MCB, MCCB, ACB, RCD, protection relay, metering CTs, live cable, protection conductor/earth cable, detuned capacitor bank, and distribution transformer, are prepared according to several important standards, for instance, the MS IEC 60364, Electrical Installations for Buildings, Suruhanjaya Tenaga (ST) – Non-Domestic Electrical Installation Safety Code, Electricity Supply Application Handbook, Tenaga Nasional Berhad (TNB).

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!