Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Codes minimaux.

Статті в журналах з теми "Codes minimaux"

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

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

Ознайомтеся з топ-18 статей у журналах для дослідження на тему "Codes minimaux".

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

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

Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.

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 та ін.
11

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.

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

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.

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

Gómez-Vilardebó, Jesús. "Routing in Accumulative Multi-hop Networks." IEEE/ACM Transactions on Networking 25, no. 5 (2017): 2815–28. https://doi.org/10.1109/TNET.2017.2703909.

Повний текст джерела
Анотація:
This paper investigates the problem of finding optimal paths in single-source single-destination accumulative multi-hop networks. We consider a single source that communicates to a single destination assisted by several relays through multiple hops. At each hop, only one node transmits, while all the other nodes receive the transmitted signal, and store it after processing/decoding and mixing it with the signals received in previous hops. That is, we consider that terminals make use of advanced energy accumulation transmission/reception techniques, such as maximal ratio combining reception of
Стилі APA, Harvard, Vancouver, ISO та ін.
14

Tang, Xu, Chao Liu, Jingjing Ma, Xiangrong Zhang, Fang Liu, and Licheng Jiao. "Large-Scale Remote Sensing Image Retrieval Based on Semi-Supervised Adversarial Hashing." Remote Sensing 11, no. 17 (2019): 2055. http://dx.doi.org/10.3390/rs11172055.

Повний текст джерела
Анотація:
Remote sensing image retrieval (RSIR), a superior content organization technique, plays an important role in the remote sensing (RS) community. With the number of RS images increases explosively, not only the retrieval precision but also the retrieval efficiency is emphasized in the large-scale RSIR scenario. Therefore, the approximate nearest neighborhood (ANN) search attracts the researchers’ attention increasingly. In this paper, we propose a new hash learning method, named semi-supervised deep adversarial hashing (SDAH), to accomplish the ANN for the large-scale RSIR task. The assumption o
Стилі APA, Harvard, Vancouver, ISO та ін.
15

Zagonel, V., G. Ferrandina, R. De Vivo, et al. "A multicentre, prospective phase 2 study of weekly schedule of carboplatin (C) plus paclitaxel (P) in first-line treatment of elderly patients (pts) with ovarian cancer (OC). The MITO (Multicentre Italian Trials in Ovarian cancer)-5 study." Journal of Clinical Oncology 24, no. 18_suppl (2006): 15012. http://dx.doi.org/10.1200/jco.2006.24.18_suppl.15012.

Повний текст джерела
Анотація:
15012 Background: CP every 3 weeks is the standard for pts with OC, but elderly pts frequently receive modified schedules or single agent chemotherapy to avoid toxicity. A prospective phase 2 study was conducted to describe tolerability and activity of a weekly schedule of CP in elderly pts with OC. Methods: Pts aged ≥70 years with chemo-naive OC, stage IC-IV, ECOG PS≤2 were eligible. Treatment was C (AUC 2) + P (60 mg/m2) on days 1, 8, 15 every 4 weeks, up to 6 cycles. A 2-stage minimax design was applied. With rate of pts without unacceptable toxicity in the first 3 cycles (UT) as primary en
Стилі APA, Harvard, Vancouver, ISO та ін.
16

Younes, El Assari, Arioua Mounir, Ez-zazi Imad, and El Oualkadi Ahmed. "Energy Performance of LDPC Scheme in Multi-Hop Wireless Sensor Network with Two base Stations Model." International Journal of Electrical and Computer Engineering (IJECE) 7, no. 2 (2017): 933–41. https://doi.org/10.11591/ijece.v7i2.pp933-941.

Повний текст джерела
Анотація:
Conservation of the energy is one of the main design issues in wireless sensor networks. The limited battery power of each sensor node is a challenging task in deploying this type of network. The challenge is crucial in reliable wireless network when implementing efficient error correcting scheme with energy consuming routing protocol. In this work, we investigated the energy performance of LDPC code in multi-hop wireless sensor network. We proposed a model of two base stations to prolong the lifetime and build a reliable and energy-efficient network. Through performed MATLAB simulations, we e
Стилі APA, Harvard, Vancouver, ISO та ін.
17

Гепко, Ігор. "M-ARY CDMA SCHEME WITH CCSK MODULATION AND PARALLEL INTERFERENCE CANCELLATION TECHNIQUE." Інфокомунікаційні та комп’ютерні технології 2, no. 02 (2022). http://dx.doi.org/10.36994/2788-5518-2021-02-02-04.

Повний текст джерела
Анотація:
In this paper, we tackle the problem of implementation a parallel interference cancellation scheme for multi-user detection (MUD) in M-ary CCSK-modulated CDMA system. Complexity remains the main obstacle to the practical implementation of MUD and a factor limiting, if not the very possibility, then the feasibility of using high order M-ary modulation formats for applications such as low-probability-of-intercept systems with a large spreading factor or, myriads of small self-powered IoT devices. The design of MUD algorithms for M-ary systems leads to a new round of growth in the receiver comple
Стилі APA, Harvard, Vancouver, ISO та ін.
18

Mishra, Bharat Bhushan, Ajay Kumar, Pijush Samui, and Thendiyath Roshni. "Buckling of laminated composite skew plate using FEM and machine learning methods." Engineering Computations ahead-of-print, ahead-of-print (2020). http://dx.doi.org/10.1108/ec-08-2019-0346.

Повний текст джерела
Анотація:
Purpose The purpose of this paper is to attempt the buckling analysis of a laminated composite skew plate using the C0 finite element (FE) model based on higher-order shear deformation theory (HSDT) in conjunction with minimax probability machine regression (MPMR) and multivariate adaptive regression spline (MARS). Design/methodology/approach HSDT considers the third-order variation of in-plane displacements which eliminates the use of shear correction factor owing to realistic parabolic transverse shear stresses across the thickness coordinate. At the top and bottom of the plate, zero transve
Стилі APA, Harvard, Vancouver, ISO та ін.
Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!