Log in

Relevant bibliographies by topics / Codes minimaux

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Codes minimaux'

Author: Grafiati

Published: 22 June 2024

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 'Codes minimaux.'

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 "Codes minimaux"

1

Devolder, Jeanne. "Codes générateurs minimaux de langages de mots bi-infinis." RAIRO - Theoretical Informatics and Applications 34, no. 6 (2000): 585–96. http://dx.doi.org/10.1051/ita:2000132.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Zubarev, V. Yu, B. V. Ponomarenko, E. G. Shanin, and A. G. Vostretsov. "Formation of Minimax Ensembles of Aperiodic Gold Codes." Journal of the Russian Universities. Radioelectronics 23, no. 2 (2020): 26–37. http://dx.doi.org/10.32603/1993-8985-2020-23-2-26-37.

Full text

Abstract:

Introduction. Signals constructed on the basis of ensembles of code sequences are widely used in digital communication systems. During development of such systems, the most attention is paid to analysis, synthesis and implementation of periodic signal ensembles. Theoretic methods for synthesis of periodic signal ensembles are developed and are in use. Considerably fewer results are received regarding construction of aperiodic signal ensembles with given properties. Theoretical methods for synthesis of such ensembles are practically nonexistent.Aim. To construct aperiodic Gold code ensembles with the best ratios of code length to ensemble volume among the most known binary codes.Materials and methods. Methods of directed search and discrete choice of the best ensemble based on unconditional preference criteria are used.Results. Full and truncated aperiodic Gold code ensembles with given length and ensemble volume were constructed. Parameters and shape of auto- and mutual correlation functions were shown for a number of constructed ensembles. Comparison of the paper results with known results for periodic Gold code ensembles has been conducted regarding growth of minimax correlation function values depending on code length and ensemble volume.Conclusion. The developed algorithms, unlike the known ones, make it possible to form both complete ensembles and ensembles taking into account the limitation of their volume. In addition, the algorithms can be extended to the tasks of forming ensembles from other families, for example, assembled from code sequences belonging to different families.

APA, Harvard, Vancouver, ISO, and other styles

3

Karpovsky, M. G., and P. Nagvajara. "Optimal codes for minimax criterion on error detection." IEEE Transactions on Information Theory 35, no. 6 (1989): 1299–305. http://dx.doi.org/10.1109/18.45288.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Chen, Xi. "Comparison of different algorithms in Reversi AI." Applied and Computational Engineering 32, no. 1 (2024): 99–105. http://dx.doi.org/10.54254/2755-2721/32/20230190.

Full text

Abstract:

Minimax and alpha-beta pruning have been widely applied in AI for various strategic board games, the utilization of greedy algorithms in this context has received less attention. The Greedy algorithms aim to make locally optimal choices at each step, exploiting immediate gains. This research aims to reveal the potential benefits and limitations of applying greedy algorithms in Reversi gaming AI, specifically through a comparison with the Minimax algorithm. A series of AI versus AI matches were conducted to evaluate and compare the performance of the three different AI algorithms. The objective was to assess their gameplay strategies and decision-making abilities by measuring their average execution time and win rates. Relevant codes and experiments will be carried out in a C++ environment, and the shown codes in this article will only have pseudocode and comments. In conclusion, the findings of this study indicate that the Greedy Algorithm is not a superior alternative to the Minimax Algorithm in competitive scenarios, particularly with increased searching depth. However, greedy algorithms still have weak competitiveness with reduced computational time. For future research, concentrating on improving the performance of the Greedy Algorithm by incorporating more advanced heuristics or adaptive strategies maybe a good choice. Additionally, combining the strengths of both the Greedy Algorithm and the Minimax Algorithm could be a promising direction for further investigation.

APA, Harvard, Vancouver, ISO, and other styles

5

Sadchenko, A. V., O. A. Kushnirenko, A. G. Yurkevych, and V. S. Sevastianov. "Study of the corrective ability of sync codes for the matched processing decoder." Технология и конструирование в электронной аппаратуре, no. 5-6 (2018): 17–23. http://dx.doi.org/10.15222/tkea2018.5-6.17.

Full text

Abstract:

Increase of the operation reliability of the frame synchronization schemes of communication systems affected by interferences might be achieved by using sync sequences optimal according to the minimax criterion and having the best ratio of the maximum side-lobe level to the main peak of the non-periodic autocorrelation function. Obviously, the longer the minimax sequence, the higher its correction ability. However, with the increase in the length of the sync code, a conflict arises between the corrective ability and the speed of data transfer. This is caused by the decrease in the duration of the information section of the frame. At the same time, as the length of the code increases, the complexity of the technical implementation of the decoder synchronization scheme increases as well. This means that when developing an information transmission system, it is necessary to find a compromise between the complexity of the technical implementation of the decoder and the required noise immunity. To solve this problem, it is necessary to study the correcting ability of binary sync codes. The purpose of this work was to study the correcting ability of binary sequences with good non-periodic auto-correlation properties using a reception scheme with matched processing. This article discusses the possibility of using Barker sequences of lengths 7, 11, and 13 and M-sequences as corrective sync codes. The authors carry out an analysis of the correcting ability of the decoder model with matched processing for Barker codes of different lengths under the conditions of a one, two, and threefold error. Analytical expressions have been obtained to determine the decoding error probability of a binary minimax code depending on the length of the sync code. The dependence of the corrective ability of the code and the maximum level of the side lobe on the length of the sync code in the range from 4 to 128 with the best nonperiodic autocorrelation functions (NPAF) is obtained. It has been established that there are length ranges for minimax sequences within which their correction ability remains constant, that is, a sync code of shorter length has the same correction ability as a longer code. Thus, the research results allow us to optimize the complexity of the technical implementation of a sync signal decoder depending on the requirements for general noise immunity and information transfer rate in a communication system. The proposed approach can be successfully used to modify the existing synchronization schemes of communication systems with code division of channels.

APA, Harvard, Vancouver, ISO, and other styles

6

Emanuel, Gunadi, R. Kristoforus J. Bendi, and Arieffianto Arieffianto. "DESAIN NON-PLAYER CHARACTER PERMAINAN TIC-TAC-TOE DENGAN ALGORITMA MINIMAX." Jurnal Ilmiah Matrik 21, no. 3 (2019): 223–33. http://dx.doi.org/10.33557/jurnalmatrik.v21i3.725.

Full text

Abstract:

Abstract : Tic-Tac-Toe is one of the board games. It is played by filling the columns on the board with X or O in such a way as to form parallel lines vertically, horizontally and diagonally. This study aims to design Non-Player Characters (NPC) in the tic-tac-toe game with the minimax algorithm. The Tic-tac-toe game will be designed with two game modes: easy and minimum random modes. While in minimax NPC mode will determine the best step. The game development process of the tic-tac-toe application is based on a linear sequence process model. In the analysis phase, the NPC will be designed based on the concept of minimax. Software modeling was designed using Unified Modeling Language (UML), and coded with Visual Basic programming. Our tests show that NPCs with the Minimax algorithm can work well.

APA, Harvard, Vancouver, ISO, and other styles

7

Mazurkov, M. I. "Class of minimax error-corecting codes based on perfect binary arrays." Radioelectronics and Communications Systems 54, no. 9 (2011): 481–98. http://dx.doi.org/10.3103/s0735272711090032.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Rodier, François. "Estimation asymptotique de la distance minimale du dual des codes BCH et polynômes de Dickson." Discrete Mathematics 149, no. 1-3 (1996): 205–21. http://dx.doi.org/10.1016/0012-365x(94)00320-i.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Bhattacharjee, Saurabh. "Universalization of Minimum Wages As A Pipe Dream: Many Discontents of the Code on Wages, 2019." Socio-Legal Review 16, no. 2 (2020): 1. http://dx.doi.org/10.55496/gwpd4458.

Full text

Abstract:

The Code on Wages, 2019 (‘Code’) seeks to universalize the law on minimum wages in India by removing the distinction between scheduled and non-scheduled employment that has been central to the application of the Minimum Wages Act, 1948. The Union Ministry of Labour and Employment claims that the elimination of this dichotomy will extend the protection of minimum wages law to more than an estimated fifty crore workers. This paper posits that the goal of universalization of minimum wages may remain a pipe dream due to several explicit exclusions, definitional limitations, and ambiguities in the Code. As a result, not only would many wage workers still remain outside the ambit of minimum wages protection, the coverage of domestic workers, who were earlier covered under the Minimum Wages Act, 1948, may also be imperilled. Further, the exclusion of employment guarantee programmes from the ambit of the provisions on minimum wages also contravenes the constitutional prohibition against forced labour under Article 23. In addition, the Code also fails to address some of the critical structural barriers in the labour economy that have impeded the implementation of minimum wages law so far. This paper argues that the Code’s failure to recognize an entitlement to minimum wages for every wage worker and address the systemic hurdles in the payment of minimum wages undermines the goal of universalization of minimum wages as well as the constitutional mandate on payment of minimum wages

APA, Harvard, Vancouver, ISO, and other styles

10

Charpin, Pascale. "Definition et Caracterisation d'une Dimension Minimale pour les Codes Principaux Nilpotents d'une Algebre Modulaire de p-Groupe Abelien Elementaire." European Journal of Combinatorics 10, no. 1 (1989): 1–12. http://dx.doi.org/10.1016/s0195-6698(89)80027-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Codes minimaux"

1

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

2

Luu, Tien Duc. "Régularité des cônes et d’ensembles minimaux de dimension 3 dans R4." Thesis, Paris 11, 2011. http://www.theses.fr/2011PA112301/document.

Full text

Abstract:

On étudie dans cette thèse la régularité des cônes et d'ensembles de dimension 3 dans l'espace Euclidien de dimension 4.Dans la première partie, on étudie d'abord la régularité Bi-Hölderienne des cônes minimaux de dimension 3 dans l'espace Euclidien de dimension 4. Ceci nous permet ensuite de montrer qu'il existe un difféomorphisme locale entre un cône minimal de dimension 3 dans l'espace Euclidien de dimension 4 et un cône minimal de dimension 3, de type P, Y ou T, loin d'origine. La méthode est la même que pour les ensembles minimaux de dimension 2. On construit des compétiteurs et on se ramène aux situations connues des ensembles minimaux de dimension 2 dans l'espace Euclidien de dimension 3.Dans la deuxième partie, on utilise le résultat de la première partie pour donner quelques résultats de régularité Bi-Hölderienne pour les ensembles minimaux de dimension 3 dans l'espace Euclidien de dimension 4. On s'intéresse aussi aux ensembles minimaux de Mumford-Shah et on obtient un résultat de l'existence d'un point de type T<br>In this thesis we study the problems of regularity of three-dimensional minimal cones and sets in l'espace Euclidien de dimension 4In the first part we study the Hölder regularity for minimal cones of dimension 3 in l'espace Euclidien de dimension 4. Then we use this for showing that there exists a local diffeomorphic mapping between a minimal cone of dimension 3 and a minimal cone of dimension 3 of type P, Y or T, away from the origin. The techniques used here are the same as the ones for the regularity of two-dimensional minimal sets. We construct some competitors to reduce to the known situation of two-dimensional minimal sets in l'espace Euclidien de dimension 3.In the second part, we use the first part to give somme results of the Hölder regularity for three-dimensional minimal sets in l'espace Euclidien de dimension 4. We interested also in Mumford-Shah minimal sets and we get a result of the existence of a T-point

APA, Harvard, Vancouver, ISO, and other styles

3

Miller, John. "High code rate, low-density parity-check codes with guaranteed minimum distance and stopping weight /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2003. http://wwwlib.umi.com/cr/ucsd/fullcit?p3090443.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Fang, Yangqin. "Minimal sets, existence and regularity." Thesis, Paris 11, 2015. http://www.theses.fr/2015PA112191/document.

Full text

Abstract:

Cette thèse s’intéresse principalement à l’existence et à la régularité desensembles minimaux. On commence par montrer, dans le chapitre 3, que le problème de Plateau étudié par Reifenberg admet au moins une solution. C’est-à-dire que, si l’onse donne un ensemble compact B⊂R^n et un sous-groupe L du groupe d’homologie de Čech H_(d-1) (B;G) de dimension (d-1) sur un groupe abelien G, on montre qu’il existe un ensemble compact E⊃B tel que L est contenu dans le noyau de l’homomorphisme H_(d-1) (B;G)→H_(d-1) (E;G) induit par l’application d’inclusion B→E, et pour lequel la mesure de Hausdorff H^d (E∖B) est minimale (sous ces contraintes). Ensuite, on montre au chapitre 4, que pour tout ensemble presque minimal glissant E de dimension 2, dans un domaine régulier Σ ressemblant localement à un demi espace, associé à la frontière glissante ∂Σ, et tel que E⊃∂Σ, il se trouve qu’à la frontière E est localement équivalent, par un homéomorphisme biHöldérien qui préserve la frontière, à un cône minimal glissant contenu dans un demi plan Ω, avec frontière glissante ∂Ω. De plus les seuls cônes minimaux possibles dans ce cas sont ∂Ω seul, ou son union avec un cône de type P_+ ou Y_+<br>This thesis focuses on the existence and regularity of minimal sets. First we show, in Chapter 3, that there exists (at least) a minimizerfor Reifenberg Plateau problems. That is, Given a compact set B⊂R^n, and a subgroup L of the Čech homology group H_(d-1) (B;G) of dimension (d-1)over an abelian group G, we will show that there exists a compact set E⊃B such that L is contained in the kernel of the homomorphism H_(d-1) (B;G)→H_(d-1) (E;G) induced by the natural inclusion map B→E, and such that the Hausdorff measure H^d (E∖B) is minimal under these constraints. Next we will show, in Chapter 4, that if E is a sliding almost minimal set of dimension 2, in a smooth domain Σ that looks locally like a half space, and with sliding boundary , and if in addition E⊃∂Σ, then, near every point of the boundary ∂Σ, E is locally biHölder equivalent to a sliding minimal cone (in a half space Ω, and with sliding boundary ∂Ω). In addition the only possible sliding minimal cones in this case are ∂Ω or the union of ∂Ω with a cone of type P_+ or Y_+

APA, Harvard, Vancouver, ISO, and other styles

5

Ketkar, Avanti Ulhas. "Code constructions and code families for nonbinary quantum stabilizer code." Thesis, Texas A&M University, 2004. http://hdl.handle.net/1969.1/2743.

Full text

Abstract:

Stabilizer codes form a special class of quantum error correcting codes. Nonbinary quantum stabilizer codes are studied in this thesis. A lot of work on binary quantum stabilizer codes has been done. Nonbinary stabilizer codes have received much less attention. Various results on binary stabilizer codes such as various code families and general code constructions are generalized to the nonbinary case in this thesis. The lower bound on the minimum distance of a code is nothing but the minimum distance of the currently best known code. The focus of this research is to improve the lower bounds on this minimum distance. To achieve this goal, various existing quantum codes are studied that have good minimum distance. Some new families of nonbinary stabilizer codes such as quantum BCH codes are constructed. Diﬀerent ways of constructing new codes from the existing ones are also found. All these constructions together help improve the lower bounds.

APA, Harvard, Vancouver, ISO, and other styles

6

Zeng, Fanxuan. "Nonlinear codes: representation, constructions, minimum distance computation and decoding." Doctoral thesis, Universitat Autònoma de Barcelona, 2014. http://hdl.handle.net/10803/284241.

Full text

Abstract:

Resum La teoria de codis estudia el disseny de codis correctors d'errors per a la transmisió fidedigne d'informació per un canal amb soroll. Un codi corrector d'errors (o simplement codi) es un proces que consisteix en expressar una seqüència d'elements sobre un alfabet de tal manera que qualsevol error que sigui introduït pot ser detactat i corregit (amb limitacions), i està basat en la tècnica d'afegir elements redundants. Aquest proces inclou la codifcació, la transmisió i la descodifcació de la seqüència d'elements. La majoria dels codis utilitzat són codis bloc i la majoria d'ells tenen una estructura lineal, que facilita el procés de codifcació i descodifcació. En aquesta memòria, estudiarem codis correctors d'errors no lineals. Mal¬grat els codis no lineals no tenen les mateixes bones propietats per codifcar i descodifcar com els lineals, el codis no lineals tenen interes ates que alguns dels millors codis no son lineals. La primera qüestió que apareix quan s'utilitzen codis no lineals és la seva representació. Els codis lineals poden ser representats utilitzant una matriu generadora o una matriu de control. La millor manera de representar un codi no lineal és utilitzar la representacio kernel/caset, que permet represen¬tar un codi mitjan<ant unes quantes paraules-codi representatives del codi en lloc de totes les paraules-codi. En aquesta memòria, s'estudia aquesta representació i es proposen algorismes efcients per calcular el kernel i els representants dels casets a partir de la llista de totes les paraules-codi. A més, s'utilitza aquesta representació per estudiar algunes propietats com la igualtat, inclusió, intersecció i unió de codis no lineals. També són analitzades algunes construccions ben conegudes (codi estès, codi punctured,...) manipulant directament el kernel i els representants dels casets dels codis no lineals que en formen part. Per identifcar un codi (lineal o no lineal), els paràmetres més importants són la longitud n, el nombre de paraules-codi M i la distància mínima d. La longitud n i la mida M són comparativament fàcils de calcular. Però, calcular la distància mínima d'un codi no és tant fàcil. De fet, s'ha demostrat que és un problema NP-hard [37]. No obstant, alguns algorismes han estat desenvolupats per calcular la distància mínima dels codis lineals utilitzant diversos mètodes: bases de Gröbner [7], arbres [25], algorismes probabilístics [13, 23] i enumeració de vectors [39]. Però, per als codis no lineals, excepte per a algunes famílies, no s'han desenvolupat algorismes generals per calcular la distància mínima. Utilitzant la representació kernel/caset i l'algorisme Brouwer-Zimmermann per calcular la distància mínima dels codis lineals, s'han descrit nous algorismes per calcular la distància mínima dels codis no lineals. El problema més costós en el procés de transmisió de la informació és la descodifcació. Per als codis lineals, la descodifcació via síndrome és el mètode més general. No obstant, no existeix un algorisme de descodifcacio general per a codis no lineals. Basats en la representació kernel/caset i en el càlcul de la distància mínima, es proposen nous algorismes per descodifcar codis lineals i no lineals. Per a alguns codis lineals (codis amb una codimensió gran) els algorismes proposats tenen un comportament millor que la descodifcació via sindrome. Per als codis no lineals, es el primer metode general de descodifcacio proposat comparable amb la descodifcacio via sindrome per a codis lineals. Finalment, la majoria d'aquests algorismes han estat avaluats usant el sistema MAGMA i s'ha desenvolupat un nou modul de MAGMA basat en els resultats d'aquesta tesis.<br>Coding theory deals with the design of error-correcting codes for the reliable transmission of information across noisy channels. An error-correcting code (or code) is a process, which consists on expressing a sequence of elements over an alphabet in such a way that any introduced error can be detected and corrected (with limitation), and it is based on adding redundancy elements. This process includes encoding, transmitting and decoding the sequence of elements. Most of the used codes are block codes and most of them have a linear structure, which facilitates the process of encoding and decoding. In this dissertation, nonlinear error-correcting codes are studied. Despite non¬linear codes do not have the same good properties for encoding and decoding as linear ones, they have interest because some of best codes are nonlinear. The frst question that arises when we use nonlinear codes is their repre-sentation. Linear codes can be represented by using a generator or parity¬check matrix. The best way to represent a nonlinear code is by using the kernel/coset representation, which allows us to represent it through some representative codewords instead of all codewords. In this dissertation, this representation is studied and efcient algorithms to compute the kernel and coset representatives from the list of codewords are given. In addition, prop¬erties such as equality, inclusion, intersection and union between nonlinear codes are given in terms of this representation. Also, some well known code constructions (extended, punctured,...) are described by manipulating directly the kernel and coset representatives ofthe constituent nonlinearcodes. In order to identify a code (linear or nonlinear), the length n, number of codewords M and minimum distance d are the most important parameters. The length n and size M are comparatively easy to compute. On the other hand, to determine the minimum distance of a code is not so easy. As a matter offact, it has been proven to be an NP-hard problem [37]. However, some algorithms have been developed to compute the minimum distance for linear codes using diferent approaches: Grabner bases [7], tree structure [25], probabilistic algorithms [13, 23] and vector enumeration [39]. For nonlinear codes, except for some special families, no general algorithms have been developed to compute their minimum distance. Using the kernel/coset representation and the Brouwer-Zimmermann's algorithm to compute the minimum dis¬tance for linear codes, new algorithms to compute the minimum distance for nonlinear codes are described. The hardest problem in the process of transmitting information is de¬coding. For linear codes, a general decoding algorithm is the syndrome de¬coding. However, there is not any general decoding method for nonlinear codes. Based on the kernel/coset representation and the minimum distance computation, new general algorithms to decode linear and nonlinear codes are proposed. For some linear codes (codes with a big codimension), the proposed algorithms have better performance than the syndrome decoding algorithm. For nonlinear codes, this is the frst general method for decoding, which is comparable to syndrome decoding for linear ones. Finally, most of these algorithms have been evaluated using the MAGMA software, and a new MAGMA package to deal with binary nonlinear codes has been developed, based in the results given in this dissertation.

APA, Harvard, Vancouver, ISO, and other styles

7

Cadic, Emmanuel. "Construction de Turbo Codes courts possédant de bonnes propriétés de distance minimale." Limoges, 2003. http://aurore.unilim.fr/theses/nxfile/default/2c131fa5-a15a-4726-8d49-663621bd2daf/blobholder:0/2003LIMO0018.pdf.

Full text

Abstract:

L'objectif de cette thèse est de réaliser des turbo codes possédant de bonnes distances minimales et de contribuer ainsi à repousser le phénomène ``d'error floor'' qui correspond à un seuil de l'ordre de 10-6 pour le taux d'erreur résiduelles binaires en dessous duquel la pente de la courbe de TEB diminue de façon significative. Ce problème s'est sensiblement amélioré avec l'apparition des codes duo-binaires de Berrou [11] qui permettent notamment d'obtenir de meilleures distances minimales. Pour obtenir de bonnes distances minimales avec des turbo codes courts (longueur inférieure à 512), la construction initialement utilisée et étudiée dans cette thèse a été celle proposée par Carlach et Vervoux [26] qui permet d'obtenir d'excellentes distances minimales mais qui malheureusement s'avère moins performante en terme de décodage notamment pour des raisons propres à la structure. Après avoir identifié les raisons qui empêchent un décodage efficace de cette famille de codes, nous faisons évoluer ces codes en utilisant des structures graphiques différentes reposant toujours sur l'assemblage de codes composants de petite complexité. L'idée est de réaliser ce changement sans pour autant perdre les qualités de distance minimale de ces codes et par conséquent il est nécessaire de comprendre pourquoi les distances minimales de cette famille initiale de codes sont bonnes et de définir un critère de choix pour les codes composants. Le critère de choix ne dépend pas de la distance minimale des codes composants mais du polynôme de transition de ces codes et permet donc de sélectionner des codes composants de très faible complexité qui sont assemblés de façon à générer des treillis cycliques à seulement 4 états. Ces treillis sont alors utilisés pour élaborer des turbo codes parallèle ou série présentant de bonnes distances minimales. Certains codes auto-duaux extrémaux sont notamment construits ainsi<br>This thesis is aimed at building turbo codes with good minimum distances and delaying the``error-floor'' which corespond to a threshold of 10-6 for the binary error rate. Under this threshold, the slope of the curve decreases significantly. This problem is alleviated by the use of duo-binary turbo codes [11] which guarantee better minimum distances. In order to obtain good minimum distances with short turbo codes (length inferior to 512), the first construction used and studied is the one proposed by Carlach and Vervoux [26]. It allows to obtain very good minimum distances but its decoding is unfortunately very difficult because of its structure. After identifying the reasons for this problem, we have modified these codes by using some graphicals structures which are the gathering of low complexity components codes. The idea is to realize this change without loosing the minimum distances properties, and consequently we had to understand why minimum distances are good for this familly of codes and define a new criteria to choose ``good'' components codes. This criteria is independent from the minimum distance of the component codes because it is derived from the Input-Output Weight Enumerator (IOWE) of the components codes. It allows us to choose components codes with very low complexity which are combined in order to provide 4-state tail-biting trellises. These trellises are then used to build multiple parallel concatenated and serial turbo codes with good minimum distances. Some extremal self-dual codes have been built in that way

APA, Harvard, Vancouver, ISO, and other styles

8

Siap, Irfan. "Generalized [Gamma]-fold weight enumerators for linear codes and new linear codes with improved minimum distances /." The Ohio State University, 2000. http://rave.ohiolink.edu/etdc/view?acc_num=osu1488193272067477.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Kumar, Santosh. "Upper bounds on minimum distance of nonbinary quantum stabilizer codes." Thesis, Texas A&M University, 2004. http://hdl.handle.net/1969.1/2744.

Full text

Abstract:

The most popular class of quantum error correcting codes is stabilizer codes. Binary quantum stabilizer codes have been well studied, and Calderbank, Rains, Shor and Sloane (July 1998) have constructed a table of upper bounds on the minimum distance of these codes using linear programming methods. However, not much is known in the case of nonbinary stabilizer codes. In this thesis, we establish a bridge between selforthogonal classical codes over the ﬁnite ﬁeld containing q2 elements and quantum codes, extending and unifying previous work by Matsumoto and Uyematsu (2000), Ashikhmin and Knill (November 2001), Kim and Walker (2004). We construct a table of upper bounds on the minimum distance of the stabilizer codes using linear programming methods that are tighter than currently known bounds. Finally, we derive code construction techniques that will help us ﬁnd new codes from existing ones. All these results help us to gain a better understanding of the theory of nonbinary stabilizer codes.

APA, Harvard, Vancouver, ISO, and other styles

10

Chan, Evelyn Yu-San. "Heuristic optimisation for the minimum distance problem." Thesis, Nottingham Trent University, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.324569.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Codes minimaux"

1

Dam, A. A. ten. Similarity transformations between minimal representations of convex polyhedral sets. National Aerospace Laboratory, 1993.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Dam, A. A. ten. Similarity transformations between minimal representations of convex polyhedral cones. National Aerospace Laboratory, 1993.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Lizak, Pawel. Minimum distance bounds for linear codes over GF(3) and GF(4). University of Salford, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

United States. National Aeronautics and Space Administration., ed. Minimal time change detection algorithm for reconfigurable control system and application to aerospace. University of California, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Prasad, Badri K., Thompson Douglas S, and Rafael Sabelli. Guide to the design of diaphragms, chords and collectors: Based on the 2006 IBC® and ASCE/SEI 7-05. ICC International Code Council, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Webster, Wendy. The Empire Comes to Britain. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198735762.003.0004.

Full text

Abstract:

This chapter looks at the many people who arrived in Britain from the British Empire—some to serve in the armed forces, others as war workers and wartime propagandists working at the BBC and in British cinema. Mixing between imperial allies produced many close friendships and camaraderie. The British media promoted a vision of an imperial community of allies. But wartime propaganda was potentially undermined by evidence of the practice of colour bars—in the empire and in Britain—and of tensions and antagonisms between imperial allies. Disruption of a publicly disseminated vision of a united empire was kept to a minimum. Colour bars in the empire and at home and antagonism between imperial allies—especially when this involved violence—were under-reported.

APA, Harvard, Vancouver, ISO, and other styles

7

Franklin, Christopher Evan. A Minimal Libertarianism. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780190682781.001.0001.

Full text

Abstract:

In this book Franklin develops and defends a version of event-causal libertarianism about free will and moral responsibility. This view is a combination of libertarianism—the view that humans sometimes act freely and that those actions are the upshots of nondeterministic causal processes—and agency reductionism—the view that the causal role of agents in exercises of free will is exhausted by the causal role of mental states and events (e.g., desires and beliefs) involving the agents. Many philosophers contend that event-causal libertarians have no advantage over compatibilists when it comes to securing a distinctively valuable and robust kind of freedom and responsibility. But Franklin argues that this is mistaken. Assuming agency reductionism is true, event-causal libertarians need only adopt the most plausible compatibilist theory and add indeterminism at the proper juncture in the genesis of human action. The result is minimal event-causal libertarianism: a model of free will with the metaphysical simplicity of compatibilism and the intuitive power of libertarianism. And yet a worry remains. Toward the end of the book, Franklin reconsiders his assumption of agency reductionism, arguing that this picture faces a hitherto unsolved problem. This problem, however, has nothing to do with indeterminism or determinism, or even libertarianism or compatibilism, but with how to understand the nature of the self and its role in the genesis of action. If this problem proves unsolvable, then not only is event-causal libertarianism untenable, so also is event-causal compatibilism.

APA, Harvard, Vancouver, ISO, and other styles

8

Mulligan, C. Tyler, and Jennifer L. Ma. Housing Codes for Repair and Maintenance: Using the General Police Power and Minimum Housing Statutes to Prevent Dwelling Deterioration. School of Government, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Wilson, Robin. Combinatorics: A Very Short Introduction. Oxford University Press, 2016. http://dx.doi.org/10.1093/actrade/9780198723493.001.0001.

Full text

Abstract:

Combinatorics is the branch of mathematics concerned with selecting, arranging, and listing or counting collections of objects. Dating back some 3000 years, and initially consisting mainly of the study of permutations and combinations, its scope has broadened to include topics such as graph theory, partitions of numbers, block designs, design of codes, and latin squares. Combinatorics: A Very Short Introduction provides an overview of the field and its applications in mathematics and computer theory, considering problems from the shortest routes covering certain stops to the minimum number of colours needed to draw a map with different colours for neighbouring countries.

APA, Harvard, Vancouver, ISO, and other styles

10

Fisher, Mary Alice. The Ethics of Conditional Confidentiality. Oxford University Press, 2015. http://dx.doi.org/10.1093/med:psych/9780199752201.001.0001.

Full text

Abstract:

This online resource is a guide designed to help therapists and other mental health professionals navigate the ethical and legal maze surrounding confidentiality. At its core is a practical Confidentiality Practice Model, which is a step-by-step guide for clarifying the ethical and legal issues that make the ethics of conditional confidentiality so complicated. Ethics codes represent the 'ethical floor,' which is the minimum standard of behavior about confidentiality. This title encourages reaching for the 'ethical ceiling,' by protecting confidentiality to the extent legally possible and not disclosing patients' confidences just because certain laws would allow them to be disclosed. It aims to demystify confidentiality for therapists, clinical supervisors, educators, ethics consultants, attorneys who represent mental health professionals, clinicians, and administrators.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Codes minimaux"

1

Cohen, Gérard D., Sihem Mesnager, and Alain Patey. "On Minimal and Quasi-minimal Linear Codes." In Cryptography and Coding. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-45239-0_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Cohen, Gérard, and Sihem Mesnager. "Variations on Minimal Linear Codes." In Coding Theory and Applications. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-17296-5_12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Ashikhmin, Alexei, and Alexander Barg. "Minimal supports in linear codes." In Cryptography and Coding. Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60693-9_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Haytaoglu, Elif, and Mehmet Emin Dalkilic. "Homomorphic Minimum Bandwidth Repairing Codes." In Information Sciences and Systems 2013. Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-01604-7_33.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Høholdt, Tom, and Jørn Justesen. "The Minimum Distance of Graph Codes." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-20901-7_12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Borello, Martino, and Abdelillah Jamous. "Dihedral Codes with Prescribed Minimum Distance." In Arithmetic of Finite Fields. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-68869-1_8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Perrin, Dominique. "Codes and Automata in Minimal Sets." In Lecture Notes in Computer Science. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-23660-5_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Diop, Soda, Guy Mobouale Wamba, Andre Saint Eudes Mialebama Bouesso, and Djiby Sow. "On the Computation of Minimal Free Resolutions with Integer Coefficients." In Algebra, Codes and Cryptology. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-36237-9_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Pinelis, Iosif. "On the Minimal Number of Even Submatrices of 0–1 Matrices." In Codes, Designs and Geometry. Springer US, 1996. http://dx.doi.org/10.1007/978-1-4613-1423-3_8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Heintz, Joos, and Jacques Morgenstern. "On associative algebras of minimal rank." In Applied Algebra, Algorithmics and Error-Correcting Codes. Springer Berlin Heidelberg, 1986. http://dx.doi.org/10.1007/3-540-16767-6_47.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Codes minimaux"

1

Raghavan, Srini, and Lamont Cooper. "Codes with Minimum CDMA Noise based on Code Spectral Lines." In 21st International Communications Satellite Systems Conference and Exhibit. American Institute of Aeronautics and Astronautics, 2003. http://dx.doi.org/10.2514/6.2003-2413.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Wang, Chih-Chun. "A coded-feedback construction of locally minimum-cost multicast network codes." In 2008 46th Annual Allerton Conference on Communication, Control, and Computing. IEEE, 2008. http://dx.doi.org/10.1109/allerton.2008.4797548.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Zhou, Ruida, Chao Tian, Tie Liu, and Hua Sun. "Capacity-Achieving Private Information Retrieval Codes from MDS-Coded Databases with Minimum Message Size." In 2019 IEEE International Symposium on Information Theory (ISIT). IEEE, 2019. http://dx.doi.org/10.1109/isit.2019.8849542.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Nandi, Asoke K., and Shafayat Abrar. "Adaptive blind equalization based on the minimum entropy principle." In 2012 International Conference on Computers and Devices for Communication (CODEC). IEEE, 2012. http://dx.doi.org/10.1109/codec.2012.6509208.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Chatterjee, Tania, Piyali Chatterjee, Subhadip Basu, Mahantapas Kundu, and Mita Nasipuri. "Protein function by minimum distance classifier from protein interaction network." In 2012 International Conference on Communications, Devices and Intelligent Systems (CODIS). IEEE, 2012. http://dx.doi.org/10.1109/codis.2012.6422271.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Kadhe, Swanand, and Alex Sprintson. "Security for minimum storage regenerating codes and locally repairable codes." In 2017 IEEE International Symposium on Information Theory (ISIT). IEEE, 2017. http://dx.doi.org/10.1109/isit.2017.8006684.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Xia, Shu-Tao, and Fang-Wei Fu. "Minimum Pseudo-Codewords of LDPC Codes." In 2006 IEEE Information Theory Workshop - ITW '06 Chengdu. IEEE, 2006. http://dx.doi.org/10.1109/itw2.2006.323767.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Savari, Serap A. "On Minimum-Redundancy Fix-Free Codes." In 2009 Data Compression Conference (DCC). IEEE, 2009. http://dx.doi.org/10.1109/dcc.2009.39.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Skachek, Vitaly. "Minimum distance bounds for expander codes." In 2008 Information Theory and Applications Workshop (ITA). IEEE, 2008. http://dx.doi.org/10.1109/ita.2008.4601075.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Huang, Qin, and Bin Zhang. "Minimal Derivative Descendants of Cyclic Codes." In 2023 IEEE International Symposium on Information Theory (ISIT). IEEE, 2023. http://dx.doi.org/10.1109/isit54713.2023.10206748.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Codes minimaux"

1

Naghipour, Avaz. Construction of quantum codes with large minimum distance from hyperbolic tessellations. Peeref, 2023. http://dx.doi.org/10.54985/peeref.2304p9929295.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Savargaonkar, Mayuresh, Benny Varghese, and Kaleb Houck. Recommendations for Minimum Required Error Codes for Electric Vehicle Charging Infrastructure. Office of Scientific and Technical Information (OSTI), 2023. http://dx.doi.org/10.2172/2369573.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Savargaonkar, Mayuresh, Benny Varghese, and Kaleb Houck. Implementation Guide for Minimum Required Error Codes in Electric Vehicle Charging Infrastructure. Office of Scientific and Technical Information (OSTI), 2023. http://dx.doi.org/10.2172/2369572.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Leis, B. N., O. C. Chang, and T. A. Bubenik. GTI-000232 Leak vs Rupture for Steel Low-Stress Pipelines. Pipeline Research Council International, Inc. (PRCI), 2001. http://dx.doi.org/10.55274/r0011871.

Full text

Abstract:

Pipeline codes and regulations worldwide have less stringent requirements for low-wall stress pipelines. Factors underlying this include a reduced exposure zone as pipeline pressure decreases and the expectation that leaks occur for lower wall stress. This report evaluates leak versus rupture as a function of wall stress with a focus on pipelines operating between 20 to 40 percent of the specified minimum yield stress. Potential threats to the integrity of low-stress pipelines are identified and worst-case scenarios for these threats evaluated to determine leak versus rupture as a function of wall stress. The evaluation is based on an assessment of existing full-scale test data, incident experience in the United States, and mechanics and fracture calculations.

APA, Harvard, Vancouver, ISO, and other styles

5

Hardy, Marsh. Review of Cost-Constrained Minimum Runs Algorithm for Response Sensitivity Analysis of the FRACT3DVS Code. Defense Technical Information Center, 1997. http://dx.doi.org/10.21236/ada327088.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Rudland. L52245 Improvements to the Two Curve Ductile Fracture Model - Soil-Elastic and Plastic Contributions. Pipeline Research Council International, Inc. (PRCI), 2007. http://dx.doi.org/10.55274/r0010625.

Full text

Abstract:

The most commonly used fracture analyses procedure for the prediction of minimum arrest toughness and fracture speed for axially running cracks in line pipe materials for natural gas transmission pipeline applications is the Battelle Two-Curve approach. This analysis procedure incorporates the gas-decompression behavior with the fracture toughness of the pipe material to predict the minimum Charpy energy required for crack arrest. For this model, the effect of backfill on the propagating crack fracture speeds is lumped into one empirically based �backfill coefficient,� which does not distinguish different soil types or strengths. This report provides a better understanding of soil behavior and its affect on the fracture speed of running axial flaws in buried line pipe materials. The results from this program are combined with other full-scale experimental data in developing a modification to the treatment of backfill in the Battelle Two-Curve approach for calculating minimum arrest toughness. This first major improvement to the Battelle Two-Curve approach is incorporated into a computer code called PIPE-DFRAC.

APA, Harvard, Vancouver, ISO, and other styles

7

Lim, Jeehee, Rodrigo Salgado, Monica Prezzi, Yao Wang, and Fei Han. Development of Protocols for Reuse Assessment of Existing Foundations in Bridge Rehabilitation and Replacement Projects. Purdue University, 2023. http://dx.doi.org/10.5703/1288284317654.

Full text

Abstract:

The existing foundations of a bridge can sometimes be reused. This may occur when a completely new bridge is built but also in bridge or superstructure widening projects. Reuse of existing foundations not only eliminates the costs associated with demolishing and disposing of old foundations, but also reduces the costs of the design and construction of new foundation elements. However, several challenges exist, including assessing the structural integrity, estimating the current capacity, estimating the remaining service life, and considering current design codes and specifications of the existing foundations, and clear guidelines for foundation reuse. The absence of foundation reuse guidelines by INDOT hinders the reuse of bridge foundations and prevents design consultants from designing new structures using existing foundations. In this project, comprehensive foundation reuse guidelines were developed in the form of flow charts based on a literature review on bridge foundation reuse design—including technical publications and existing standards and codes—and a set of analyses. The proposed guidelines include detailed guidance on inspection of the structural integrity of existing foundations, determination of as-built geometry of existing foundations, capacity estimation of existing foundations, minimum requirements for foundation reuse, and selection of foundation reuse solutions. The proposed guidelines for foundation reuse design were tested in an ongoing INDOT project. From the implementation project, we found that a complete site investigation that produces reliable estimation of soil profile and properties, is essential to determine whether there is reserve capacity in existing foundations. Additional site investigation is generally worth doing, not only to account for any strengthening of the soil that may have occurred over time, but also because of the greater accuracy in interpretation and analysis that results. We also found that use of the most current, cutting-edge methods can be useful in estimating the reserve capacity of existing foundations, and that design checks using different design codes can produce contrasting results.

APA, Harvard, Vancouver, ISO, and other styles

8

Knepper, Randy. NAPSR-C11 State Pipeline Safety Requirements-Initiatives Providing Increased Public Safety Levels vs CFR. Pipeline Research Council International, Inc. (PRCI), 2011. http://dx.doi.org/10.55274/r0011864.

Full text

Abstract:

Over 1,150 specific safety enhancements described in 22 categories ranging from enhanced reporting to record-keeping to cathodic protection to design and installation requirements have been adopted by states to help enhance pipeline safety. Formalized pipeline replacement programs have been employed by many states to address the aging pipeline infrastructure. To date, 45 states have at least one initiative above and beyond the minimum Code of Federal Regulations applying to one or more pipeline operators within their state. It is hoped this report will serve as a detailed resource for examining some of the pipeline safety best practices established by states.

APA, Harvard, Vancouver, ISO, and other styles

9

Kolaj, M., S. Halchuk, and J. Adams. Sixth Generation seismic hazard model of Canada: final input files used to generate the 2020 National Building Code of Canada seismic hazard values. Natural Resources Canada/CMSS/Information Management, 2023. http://dx.doi.org/10.4095/331387.

Full text

Abstract:

The enclosed files provide OpenQuake compatible input files to reproduce the 6th Generation Seismic Hazard Model of Canada (CanadaSHM6) as used to produce the seismic hazard values for the 2020 edition of the National Building Code of Canada (NBCC 2020). Example hazard values at selected localities are included, in order for other users to verify that the model has been implemented as we intended. This report contains minimal technical information on CanadaSHM6; complete documentation will be released as a separate Open File. This report supersedes Open File 8630, and the values derived from the model and the online seismic hazard tool described herein supersede the trial values provided in Open File 8629.

APA, Harvard, Vancouver, ISO, and other styles

10

Galambos, J. D., Y. K. M. Peng, D. J. Strickler, and R. L. Reid. Systems code assessment of innovations, major design drivers, and minimum sizes of INTOR (International Tokamak Reactor) and ETR-like designs. Office of Scientific and Technical Information (OSTI), 1987. http://dx.doi.org/10.2172/5830954.

Full text

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!