Готові списки джерел за темами / Codes minimaux

Зміст

  1. Статті в журналах
  2. Дисертації
  3. Книги
  4. Частини книг
  5. Тези доповідей конференцій
  6. Звіти організацій

Добірка наукової літератури з теми "Codes minimaux"

Автор: Grafiati
Опубліковано: 22 червня 2024
Оновлено: 31 липня 2025

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Codes minimaux".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Анотація:
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 wi
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Анотація:
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
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Анотація:
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
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Анотація:
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 bas
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

Joundan, Issam Abderrahman, Said Nouh, Mohamed Azouazi, and Abdelwahed Namir. "A new efficient way based on special stabilizer multiplier permutations to attack the hardness of the minimum weight search problem for large BCH codes." International Journal of Electrical and Computer Engineering (IJECE) 9, no. 2 (2019): 1232–39. https://doi.org/10.11591/ijece.v9i2.pp1232-1239.

Повний текст джерела
Анотація:
BCH codes represent an important class of cyclic error-correcting codes; their minimum distances are known only for some cases and remains an open NP-Hard problem in coding theory especially for large lengths. This paper presents an efficient scheme ZSSMP (Zimmermann Special Stabilizer Multiplier Permutation) to find the true value of the minimum distance for many large BCH codes. The proposed method consists in searching a codeword having the minimum weight by Zimmermann algorithm in the sub codes fixed by special stabilizer multiplier permutations. These few sub codes had very small dimensio
Стилі APA, Harvard, Vancouver, ISO та ін.
9

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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

El, Mehdi Bellfkih, Nouh Said, Chemseddine Idrissi Imrane, Louartiti Khalid, and Mouline Jamal. "Newfamily of error-correcting codes based on genetic algorithms." IAES International Journal of Artificial Intelligence (IJ-AI) 14, no. 2 (2025): 1077–86. https://doi.org/10.11591/ijai.v14.i2.pp1077-1086.

Повний текст джерела
Анотація:
This paper introduces a novel error-correcting code (ECC) construction and decoding approach utilizing genetic algorithms (GAs). Classical ECCs often struggle with efficiency in correcting multiple errors due to time-consuming matrix-based encoding and decoding processes. Our GA-based method opti mizes generator vectors to maximize the minimum distance between codewords, enhancing error correction capabilities. Specifically, we construct a new family of ECCs with code length 31, dimension 12, and minimum distance 7, reducing complexity from O(kn) to O(k(n−k)) by encoding message blocks w
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Дисертації з теми "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.

Повний текст джерела
Анотація:
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 à
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Анотація:
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
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

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

Повний текст джерела
Анотація:
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
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Анотація:
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
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Анотація:
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
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Анотація:
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
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Анотація:
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 finite field containing q2 elements and quantum codes, extending and unifying previous work by Matsumoto and Uyematsu (2000), Ashikhmin and Knill (
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Книги з теми "Codes minimaux"

1

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

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

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

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

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

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

Castagnoli, Guy E. On the minimum distance of long cyclic codes and cyclic redundancy-check codes. 1989.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
7

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

Повний текст джерела
Анотація:
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 em
Стилі APA, Harvard, Vancouver, ISO та ін.
8

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

Повний текст джерела
Анотація:
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
Стилі APA, Harvard, Vancouver, ISO та ін.
9

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.

Знайти повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

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

Повний текст джерела
Анотація:
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
Стилі APA, Harvard, Vancouver, ISO та ін.
Більше джерел

Частини книг з теми "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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
10

Bouznif, Marwane, Frédéric Havet, and Myriam Preissmann. "Minimum-Density Identifying Codes in Square Grids." In Algorithmic Aspects in Information and Management. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-41168-2_7.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Codes minimaux"

1

Stylianou, Evagoras, Vladimir Sidorenko, Christian Deppe, and Holger Boche. "Minimal Trellises for Degenerate Decoding of Quantum Stabilizer Codes." In GLOBECOM 2024 - 2024 IEEE Global Communications Conference. IEEE, 2024. https://doi.org/10.1109/globecom52923.2024.10901586.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
2

Chen, Wenting, and Jiantao Li. "Two classes of optimal cyclic codes with minimum distance 4." In 4th International Conference on Signal Image Processing and Communication, edited by Xianye Ben and Lei Chen. SPIE, 2024. http://dx.doi.org/10.1117/12.3040979.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
3

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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
5

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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
6

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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
4

Parnell, Gregory, Robert Curry, Eric Specking, et al. An all-hazards return on investment (ROI) model to evaluate U.S. Army installation resilient strategies. Engineer Research and Development Center (U.S.), 2025. https://doi.org/10.21079/11681/49733.

Повний текст джерела
Анотація:
The paper describes our project to develop, verify, and deploy an All-Hazards Return of Investment model for the U.S. Army Engineer Research and Development Center to provide army installations with a decision support tool for evaluating strategies to make existing installation facilities more resilient. The need for increased resilience to extreme weather was required by U.S. code and DoD guidance, as well as an army strategic plan stipulating an ROI model to evaluate relevant resilient strategies. The ERDC integrated the University of Arkansas designed model into a new army installation plan
Стилі APA, Harvard, Vancouver, ISO та ін.
5

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.

Повний текст джерела
Анотація:
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
Стилі APA, Harvard, Vancouver, ISO та ін.
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.

Повний текст джерела
Анотація:
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 distingui
Стилі APA, Harvard, Vancouver, ISO та ін.
7

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.

Повний текст джерела
Стилі APA, Harvard, Vancouver, ISO та ін.
8

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.

Повний текст джерела
Анотація:
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 exist
Стилі APA, Harvard, Vancouver, ISO та ін.
9

Choquette, Gary, Richard Rans, and Warren Peterson. PR000-22605-R06 Accurate Compressibility Estimates for Natural Gas. Pipeline Research Council International, Inc. (PRCI), 2024. http://dx.doi.org/10.55274/r0000068.

Повний текст джерела
Анотація:
This document describes methods to calculate estimated gas compressibility without having the full gas composition. The purpose of these methods is for use cases where reasonable accuracy is required but not critical and the methods must be computationally efficient such that they can be used in programmable logic controllers, remote terminal units, and supervisory control and data acquisition systems; akin to the functionality of the NX-19 or AGA-8 Gross methods but with higher accuracy. Multiple simplified calculation methods were evaluated with one method performing significantly better tha
Стилі APA, Harvard, Vancouver, ISO та ін.
10

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.

Повний текст джерела
Анотація:
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 examinin
Стилі APA, Harvard, Vancouver, ISO та ін.
Також вас можуть зацікавити розширені добірки на тему "Codes minimaux" для конкретних типів джерел:
Статті в журналах Дисертації Книги
Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!

До бібліографії