Gotowa bibliografia na temat „Codes minimaux”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Codes minimaux”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Codes minimaux"
Devolder, Jeanne. "Codes générateurs minimaux de langages de mots bi-infinis". RAIRO - Theoretical Informatics and Applications 34, nr 6 (listopad 2000): 585–96. http://dx.doi.org/10.1051/ita:2000132.
Pełny tekst źródłaZubarev, V. Yu, B. V. Ponomarenko, E. G. Shanin i A. G. Vostretsov. "Formation of Minimax Ensembles of Aperiodic Gold Codes". Journal of the Russian Universities. Radioelectronics 23, nr 2 (28.04.2020): 26–37. http://dx.doi.org/10.32603/1993-8985-2020-23-2-26-37.
Pełny tekst źródłaKarpovsky, M. G., i P. Nagvajara. "Optimal codes for minimax criterion on error detection". IEEE Transactions on Information Theory 35, nr 6 (1989): 1299–305. http://dx.doi.org/10.1109/18.45288.
Pełny tekst źródłaChen, Xi. "Comparison of different algorithms in Reversi AI". Applied and Computational Engineering 32, nr 1 (22.01.2024): 99–105. http://dx.doi.org/10.54254/2755-2721/32/20230190.
Pełny tekst źródłaSadchenko, A. V., O. A. Kushnirenko, A. G. Yurkevych i V. S. Sevastianov. "Study of the corrective ability of sync codes for the matched processing decoder". Технология и конструирование в электронной аппаратуре, nr 5-6 (2018): 17–23. http://dx.doi.org/10.15222/tkea2018.5-6.17.
Pełny tekst źródłaEmanuel, Gunadi, R. Kristoforus J. Bendi i Arieffianto Arieffianto. "DESAIN NON-PLAYER CHARACTER PERMAINAN TIC-TAC-TOE DENGAN ALGORITMA MINIMAX". Jurnal Ilmiah Matrik 21, nr 3 (19.12.2019): 223–33. http://dx.doi.org/10.33557/jurnalmatrik.v21i3.725.
Pełny tekst źródłaMazurkov, M. I. "Class of minimax error-corecting codes based on perfect binary arrays". Radioelectronics and Communications Systems 54, nr 9 (wrzesień 2011): 481–98. http://dx.doi.org/10.3103/s0735272711090032.
Pełny tekst źródłaRodier, François. "Estimation asymptotique de la distance minimale du dual des codes BCH et polynômes de Dickson". Discrete Mathematics 149, nr 1-3 (luty 1996): 205–21. http://dx.doi.org/10.1016/0012-365x(94)00320-i.
Pełny tekst źródłaBhattacharjee, Saurabh. "Universalization of Minimum Wages As A Pipe Dream: Many Discontents of the Code on Wages, 2019". Socio-Legal Review 16, nr 2 (styczeń 2020): 1. http://dx.doi.org/10.55496/gwpd4458.
Pełny tekst źródłaCharpin, 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, nr 1 (styczeń 1989): 1–12. http://dx.doi.org/10.1016/s0195-6698(89)80027-7.
Pełny tekst źródłaRozprawy doktorskie na temat "Codes minimaux"
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.
Pełny tekst źródłaAlgebraic 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
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.
Pełny tekst źródłaIn 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
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.
Pełny tekst źródłaFang, Yangqin. "Minimal sets, existence and regularity". Thesis, Paris 11, 2015. http://www.theses.fr/2015PA112191/document.
Pełny tekst źródłaThis 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_+
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.
Pełny tekst źródłaZeng, Fanxuan. "Nonlinear codes: representation, constructions, minimum distance computation and decoding". Doctoral thesis, Universitat Autònoma de Barcelona, 2014. http://hdl.handle.net/10803/284241.
Pełny tekst źródłaCadic, 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.
Pełny tekst źródłaThis 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
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.
Pełny tekst źródłaKumar, Santosh. "Upper bounds on minimum distance of nonbinary quantum stabilizer codes". Thesis, Texas A&M University, 2004. http://hdl.handle.net/1969.1/2744.
Pełny tekst źródłaChan, 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.
Pełny tekst źródłaKsiążki na temat "Codes minimaux"
Dam, A. A. ten. Similarity transformations between minimal representations of convex polyhedral sets. Amsterdam: National Aerospace Laboratory, 1993.
Znajdź pełny tekst źródłaDam, A. A. ten. Similarity transformations between minimal representations of convex polyhedral cones. Amsterdam: National Aerospace Laboratory, 1993.
Znajdź pełny tekst źródłaLizak, Pawel. Minimum distance bounds for linear codes over GF(3) and GF(4). Salford: University of Salford, 1992.
Znajdź pełny tekst źródłaUnited States. National Aeronautics and Space Administration., red. Minimal time change detection algorithm for reconfigurable control system and application to aerospace. [Los Angeles, CA: University of California, 1994.
Znajdź pełny tekst źródłaPrasad, Badri K., Thompson Douglas S i Rafael Sabelli. Guide to the design of diaphragms, chords and collectors: Based on the 2006 IBC® and ASCE/SEI 7-05. Country Club Hills, IL: ICC International Code Council, 2009.
Znajdź pełny tekst źródłaWebster, Wendy. The Empire Comes to Britain. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198735762.003.0004.
Pełny tekst źródłaFranklin, Christopher Evan. A Minimal Libertarianism. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780190682781.001.0001.
Pełny tekst źródłaMulligan, C. Tyler, i 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.
Znajdź pełny tekst źródłaWilson, Robin. Combinatorics: A Very Short Introduction. Oxford University Press, 2016. http://dx.doi.org/10.1093/actrade/9780198723493.001.0001.
Pełny tekst źródłaFisher, Mary Alice. The Ethics of Conditional Confidentiality. Oxford University Press, 2015. http://dx.doi.org/10.1093/med:psych/9780199752201.001.0001.
Pełny tekst źródłaCzęści książek na temat "Codes minimaux"
Cohen, Gérard D., Sihem Mesnager i Alain Patey. "On Minimal and Quasi-minimal Linear Codes". W Cryptography and Coding, 85–98. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-45239-0_6.
Pełny tekst źródłaCohen, Gérard, i Sihem Mesnager. "Variations on Minimal Linear Codes". W Coding Theory and Applications, 125–31. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-17296-5_12.
Pełny tekst źródłaAshikhmin, Alexei, i Alexander Barg. "Minimal supports in linear codes". W Cryptography and Coding, 13. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60693-9_3.
Pełny tekst źródłaHaytaoglu, Elif, i Mehmet Emin Dalkilic. "Homomorphic Minimum Bandwidth Repairing Codes". W Information Sciences and Systems 2013, 339–48. Cham: Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-01604-7_33.
Pełny tekst źródłaHøholdt, Tom, i Jørn Justesen. "The Minimum Distance of Graph Codes". W Lecture Notes in Computer Science, 201–12. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-20901-7_12.
Pełny tekst źródłaBorello, Martino, i Abdelillah Jamous. "Dihedral Codes with Prescribed Minimum Distance". W Arithmetic of Finite Fields, 147–59. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-68869-1_8.
Pełny tekst źródłaPerrin, Dominique. "Codes and Automata in Minimal Sets". W Lecture Notes in Computer Science, 35–46. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-23660-5_4.
Pełny tekst źródłaDiop, Soda, Guy Mobouale Wamba, Andre Saint Eudes Mialebama Bouesso i Djiby Sow. "On the Computation of Minimal Free Resolutions with Integer Coefficients". W Algebra, Codes and Cryptology, 51–72. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-36237-9_3.
Pełny tekst źródłaPinelis, Iosif. "On the Minimal Number of Even Submatrices of 0–1 Matrices". W Codes, Designs and Geometry, 81–89. Boston, MA: Springer US, 1996. http://dx.doi.org/10.1007/978-1-4613-1423-3_8.
Pełny tekst źródłaHeintz, Joos, i Jacques Morgenstern. "On associative algebras of minimal rank". W Applied Algebra, Algorithmics and Error-Correcting Codes, 1–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 1986. http://dx.doi.org/10.1007/3-540-16767-6_47.
Pełny tekst źródłaStreszczenia konferencji na temat "Codes minimaux"
Raghavan, Srini, i Lamont Cooper. "Codes with Minimum CDMA Noise based on Code Spectral Lines". W 21st International Communications Satellite Systems Conference and Exhibit. Reston, Virigina: American Institute of Aeronautics and Astronautics, 2003. http://dx.doi.org/10.2514/6.2003-2413.
Pełny tekst źródłaWang, Chih-Chun. "A coded-feedback construction of locally minimum-cost multicast network codes". W 2008 46th Annual Allerton Conference on Communication, Control, and Computing. IEEE, 2008. http://dx.doi.org/10.1109/allerton.2008.4797548.
Pełny tekst źródłaZhou, Ruida, Chao Tian, Tie Liu i Hua Sun. "Capacity-Achieving Private Information Retrieval Codes from MDS-Coded Databases with Minimum Message Size". W 2019 IEEE International Symposium on Information Theory (ISIT). IEEE, 2019. http://dx.doi.org/10.1109/isit.2019.8849542.
Pełny tekst źródłaNandi, Asoke K., i Shafayat Abrar. "Adaptive blind equalization based on the minimum entropy principle". W 2012 International Conference on Computers and Devices for Communication (CODEC). IEEE, 2012. http://dx.doi.org/10.1109/codec.2012.6509208.
Pełny tekst źródłaChatterjee, Tania, Piyali Chatterjee, Subhadip Basu, Mahantapas Kundu i Mita Nasipuri. "Protein function by minimum distance classifier from protein interaction network". W 2012 International Conference on Communications, Devices and Intelligent Systems (CODIS). IEEE, 2012. http://dx.doi.org/10.1109/codis.2012.6422271.
Pełny tekst źródłaKadhe, Swanand, i Alex Sprintson. "Security for minimum storage regenerating codes and locally repairable codes". W 2017 IEEE International Symposium on Information Theory (ISIT). IEEE, 2017. http://dx.doi.org/10.1109/isit.2017.8006684.
Pełny tekst źródłaXia, Shu-Tao, i Fang-Wei Fu. "Minimum Pseudo-Codewords of LDPC Codes". W 2006 IEEE Information Theory Workshop - ITW '06 Chengdu. IEEE, 2006. http://dx.doi.org/10.1109/itw2.2006.323767.
Pełny tekst źródłaSavari, Serap A. "On Minimum-Redundancy Fix-Free Codes". W 2009 Data Compression Conference (DCC). IEEE, 2009. http://dx.doi.org/10.1109/dcc.2009.39.
Pełny tekst źródłaSkachek, Vitaly. "Minimum distance bounds for expander codes". W 2008 Information Theory and Applications Workshop (ITA). IEEE, 2008. http://dx.doi.org/10.1109/ita.2008.4601075.
Pełny tekst źródłaHuang, Qin, i Bin Zhang. "Minimal Derivative Descendants of Cyclic Codes". W 2023 IEEE International Symposium on Information Theory (ISIT). IEEE, 2023. http://dx.doi.org/10.1109/isit54713.2023.10206748.
Pełny tekst źródłaRaporty organizacyjne na temat "Codes minimaux"
Naghipour, Avaz. Construction of quantum codes with large minimum distance from hyperbolic tessellations. Peeref, kwiecień 2023. http://dx.doi.org/10.54985/peeref.2304p9929295.
Pełny tekst źródłaSavargaonkar, Mayuresh, Benny Varghese i Kaleb Houck. Recommendations for Minimum Required Error Codes for Electric Vehicle Charging Infrastructure. Office of Scientific and Technical Information (OSTI), wrzesień 2023. http://dx.doi.org/10.2172/2369573.
Pełny tekst źródłaSavargaonkar, Mayuresh, Benny Varghese i Kaleb Houck. Implementation Guide for Minimum Required Error Codes in Electric Vehicle Charging Infrastructure. Office of Scientific and Technical Information (OSTI), wrzesień 2023. http://dx.doi.org/10.2172/2369572.
Pełny tekst źródłaLeis, B. N., O. C. Chang i T. A. Bubenik. GTI-000232 Leak vs Rupture for Steel Low-Stress Pipelines. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), styczeń 2001. http://dx.doi.org/10.55274/r0011871.
Pełny tekst źródłaHardy, Marsh. Review of Cost-Constrained Minimum Runs Algorithm for Response Sensitivity Analysis of the FRACT3DVS Code. Fort Belvoir, VA: Defense Technical Information Center, kwiecień 1997. http://dx.doi.org/10.21236/ada327088.
Pełny tekst źródłaRudland. L52245 Improvements to the Two Curve Ductile Fracture Model - Soil-Elastic and Plastic Contributions. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), maj 2007. http://dx.doi.org/10.55274/r0010625.
Pełny tekst źródłaLim, Jeehee, Rodrigo Salgado, Monica Prezzi, Yao Wang i 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.
Pełny tekst źródłaKnepper, Randy. NAPSR-C11 State Pipeline Safety Requirements-Initiatives Providing Increased Public Safety Levels vs CFR. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), wrzesień 2011. http://dx.doi.org/10.55274/r0011864.
Pełny tekst źródłaKolaj, M., S. Halchuk i 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.
Pełny tekst źródłaGalambos, J. D., Y. K. M. Peng, D. J. Strickler i 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), październik 1987. http://dx.doi.org/10.2172/5830954.
Pełny tekst źródła