Literatura académica sobre el tema "Code Construction Networks"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Code Construction Networks".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Code Construction Networks"
Skachek, Vitaly. "Recursive Code Construction for Random Networks". IEEE Transactions on Information Theory 56, n.º 3 (marzo de 2010): 1378–82. http://dx.doi.org/10.1109/tit.2009.2039163.
Texto completoSanna, Michele y Ebroul Izquierdo. "A Survey of Linear Network Coding and Network Error Correction Code Constructions and Algorithms". International Journal of Digital Multimedia Broadcasting 2011 (2011): 1–12. http://dx.doi.org/10.1155/2011/857847.
Texto completoZhao, Xubo. "An efficient basic convolutional network code construction algorithm on cyclic networks". AEU - International Journal of Electronics and Communications 67, n.º 12 (diciembre de 2013): 1072–78. http://dx.doi.org/10.1016/j.aeue.2013.06.010.
Texto completoAbbas, Huda Saleh, Mark A. Gregory y Michael W. Austin. "A New Prime Code for Synchronous Optical Code Division Multiple-Access Networks". Journal of Computer Networks and Communications 2018 (2018): 1–11. http://dx.doi.org/10.1155/2018/3192520.
Texto completoShapoval, Nataliia y Denys Lobanov. "Detecting Handwritten Line for TikZ Code Generating". Electronics and Control Systems 2, n.º 76 (23 de junio de 2023): 56–60. http://dx.doi.org/10.18372/1990-5548.76.17671.
Texto completoDuo, Bin, Xiaoling Zhong y Yong Guo. "Practical polar code construction for degraded multiple-relay networks". China Communications 14, n.º 4 (abril de 2017): 127–39. http://dx.doi.org/10.1109/cc.2017.7927571.
Texto completoNlend, Samuel y Theo G. Swart. "Construction and Characterization of Optical Orthogonal Codes (n,w,1) for Fast Frequency Hopping-Optical Code Division Multiple Access". ECTI Transactions on Electrical Engineering, Electronics, and Communications 20, n.º 1 (18 de febrero de 2022): 62–73. http://dx.doi.org/10.37936/ecti-eec.2022201.246105.
Texto completoGRELCK, CLEMENS, SVEN-BODO SCHOLZ y ALEX SHAFARENKO. "A GENTLE INTRODUCTION TO S-NET: TYPED STREAM PROCESSING AND DECLARATIVE COORDINATION OF ASYNCHRONOUS COMPONENTS". Parallel Processing Letters 18, n.º 02 (junio de 2008): 221–37. http://dx.doi.org/10.1142/s0129626408003351.
Texto completoLi, Jian, Tongtong Li y Jian Ren. "Optimal Construction of Regenerating Code Through Rate-Matching in Hostile Networks". IEEE Transactions on Information Theory 63, n.º 7 (julio de 2017): 4414–29. http://dx.doi.org/10.1109/tit.2017.2694441.
Texto completoLi, Xiyang y Kenneth W. Shum. "Mixed construction of OOC for optical code division multiple access networks". IET Communications 13, n.º 7 (23 de abril de 2019): 837–41. http://dx.doi.org/10.1049/iet-com.2018.5602.
Texto completoTesis sobre el tema "Code Construction Networks"
Ferdinand, N. S. (Nuwan Suresh). "Low complexity lattice codes for communication networks". Doctoral thesis, Oulun yliopisto, 2016. http://urn.fi/urn:isbn:9789526210964.
Texto completoTiivistelmä Hilakoodit saavuttavat AWGN kapasiteetin ja sopivat luonnollisesti moniin monen päätelaitteen verkkoihin niihin sisältyvän rakenteen vuoksi. Vaikka lukuisat informaatioteoreettiset tutkimustyöt todistavat hilakoodien tärkeyden näille verkoille, käytännössä alhaisen kompleksisuuden hilajärjestelmiä on vielä vähän. Näin ollen tämän tutkielman tarkoitus on kehittää useita metodeja, jotta hilakoodeista saadaan käytännöllisiä viestintäverkkoihin. Aluksi, ehdotamme tehokkaan hilakoodausjärjestelmän reaaliarvoisille, full duplexisille yksi- ja kaksisuuntaisille välittäjäkanaville. Käytämme hilan hajottamista, superpositiota ja lohko-Markov -koodausta ehdottaessamme yksinkertaiset ja siltikin kapasiteetin saavuttavat koodaus- ja dekoodausjärjestelmät näihin välityskanaviin. Käyttämällä informaatioteoreettisia työkaluja, osoitamme näiden järjestelmien saavutettavat nopeudet, jotka ovat yhtä suuret kuin parhaimmat tunnetut nopeudet. Sitten rakennamme käytännölliset ja alhaisen monimutkaisuuden toteutukset ehdotetuille välitysjärjestelmille käyttäen alhaisen tiheyden hilakoodeja. Esitämme näille järjestelmille numeeriset arvioinnit, jotka näyttävät että nämä toteutukset saavuttavat tehokkuuden, joka on 2.5dB:n päässä teoreettisista rajoista. Tutkimme muotoilu- ja koodaushäviön vaikutusta välityskanavien tehokkuuteen. Sitten, ehdotamme alhaisen monimutkaisuuden hilakoodirakenteen, joka tarjoaa korkean muotoilu- ja koodausvahvistuksen. Ensin, kokonaislukuinformaatio on koodattu muotoiltuihin kokonaislukuihin. Esitämme kaksi metodia tähän tehtävään; 'Voronoi kokonaisluvut' ja 'ei yhtenäiset kokonaisluvut'. Näillä muotoilluilla kokonaisluvuilla on muotoiluvahvistusta kokonaislukuhilalle. Toisena askeleena, esitämme yleiset puitteet systemaattiseen kokonaislukujen koodaukseen käyttäen korkeaulotteisia hiloja alhaisen kolmiogeneraattori- tai pariteettivarmistusmatriiseja, jotka säilyttävät samalla muotoiluvahvistuksen. Ehdotettua järjestelmää voidaan käyttää muotoilemaan korkeaulotteisia hiloja kuten alhaisen tiheyden hilakoodeja, LDA-hiloja, jne. Esitämme kattavan analyysin käyttäen alhaisen tiheyden hilakoodeja. Käyttämällä muotoiluhiloina E8aa ja BW16a, näytämme numeerisesti 'Voronoi kokonaislukujen' käyttämisen seurauksena saavutettavat hilojen muotoiluvahvistukset, jotka ovat jopa 0.65dB ja 0.86dB. Näytämme myös numeerisesti että 'ei yhtenäisillä kokonaisluvuilla' on muotoiluvahvistusta jopa 1.25dB. Nämä muotoiluoperaatiot voidaan toteuttaa alhaisemmalla monimutkaisuudella kuin aikaisemmat 'alhaisen tiheyden hilakoodien muotoilumenetelmät' ja muotoiluvahvistukset ovat suuremmat kuin aikaisemmin raportoidut tapaukset, jotka ovat suuruusluokaltaan 0.4dB. Viimeiseksi, ehdotamme käytännöllisen koodikonstruktion alhaisella monimutkaisuudella 'laske ja lähetä' -menetelmään. Kehitämme uuden koodikonstruktion, jota kutsumme 'sekoitetuksi sisäkkäiseksi hilakoodikonstruktioksi'. Tämä koodikonstruktio käyttää kahta eroteltavissa olevaa sisäkkäistä hilaa koodaamaan kokonaisluvut siellä, missä muotoilu tehdään pienen ulottuvuuden hiloilla korkean muotoiluvahvistuksella ja koodaus toteutetaan käyttäen korkean koodausvahvistuksen omaavaa korkeaulottuvuuksista hilaa. Tämä konstruktio säilyttää muotoilu- ja koodausvahvistukset kullekin muotoilu- ja koodaushilalle. Lisäksi, todistamme isomorfismin olemassaolon tässä konstruktiossa siten, että lineaarisen hilakoodien kombinaatio voidaan kuvata lineaarisena kokonaislukujen kombinaationa äärellisessä kunnassa. Näin ollen tätä konstruktiota voidaan helposti käyttää missä tahansa 'laske ja lähetä' -sovelluksessa. Esitämme muokatun LDLC dekooderin lineaarisen viestikombinaation estimointiin. Arvioimme tehon numeerisesti
Rossetti, Anibal Martins. "Identificação de competências essenciais para formação e gerência de redes de empresas da construção civil". Universidade de São Paulo, 2005. http://www.teses.usp.br/teses/disponiveis/18/18140/tde-08052007-185644/.
Texto completoIn the civil construction, the management perspectives of organizations are to adapt to new sceneries and one of the ways is to create enterprise networks. To create and management enterprise networks it is necessary the adequation the core competence, because well succeeded organizations are those which demonstrate to develop its core competences to offer excellent standards in goods and services. In this work proposals and possible results of the issues concerning to the process of networks formation area analyzed. It is also suggest a systematization to identify core competence to the formation and management of enterprise networks in civil construction sector that have common goals and maintain the independence and individuality, to create a network that allows the accomplishment of joined actions, making the solution of common problems easier and making new opportunities feasible. These enterprises, finally identified, join themselves in a network and can reduce costs, divide risks, reach new markets, qualify products and services, and have access to new technologies. The practical application of this work is done throughout a case study which explores a civil construction task arming to identify the competence inserted in the participate enterprise, that it will be possible to affirm which the core competence to the formation of the network and which are able to bring benefits to itself and to others enterprise networks. It is intended, as a result of this research, to determine which enterprises are capable to operate in a new business, in a network configuration, involving deep evaluation of core competences and verifying if they will guarantee a competitive sustentation in desired markets.
Ghatak, Anirban. "Algebraic Techniques for Error Correction in Random Networks". Thesis, 2016. https://etd.iisc.ac.in/handle/2005/4373.
Texto completoAgrawal, Shweta Prem. "Efficient, provably secure code constructions". Thesis, 2011. http://hdl.handle.net/2152/ETD-UT-2011-05-2675.
Texto completotext
Hsieh, Wen-Pin y 謝文彬. "A New Algorithm for the Construction of a Generic Linear Network Code". Thesis, 2007. http://ndltd.ncl.edu.tw/handle/27114679558140393169.
Texto completo國立清華大學
通訊工程研究所
95
In this thesis, we consider generic linear network codes introduced by Li et al. We give a new algorithm for the construction of a generic linear network code on an acyclic network, which is an enhancement of a previously proposed algorithm by Yeung et al. for the construction of a generic linear network code. We also obtain an improved lower bound on the size of the finite field from which the source symbols are taken.
林佩璇. "Design of Multirate Schemes and Code Constructions for MC-DS/CDMA Wireless Networks". Thesis, 2002. http://ndltd.ncl.edu.tw/handle/40865234936722213730.
Texto completo國立中興大學
電機工程學系
90
The second-generation (2G) systems impacts the modern life greatly but only support the voice-orient applications. It is desired a variety of data services with different quality requirements in the future wireless systems. Multicarrier direct-sequence code-division multiple-access (MC-DS/CDMA) is one possible scheme for the new-generation wireless networks. In this thesis, a MC-DS/CDMA system with 2D spreading codes is proposed to provide multirate services by varying the number of carrier frequencies and code length. First, new constructions of 2D orthogonal codes is presented. The proposed 2D codes possess zero cyclic auto- and cross-correlation properties. By using these new codes, multiple access interference (MAI) can be eliminated for MC-DS/CDMA systems in asynchronous channels. In addition, several multirate schemes for MC-DS/CDMA systems with the proposed 2D codes are discussed. By using these schemes, multirate transmissions can be achieved and the bandwidth efficiency can be improved. Owing to the above multirate schemes, the proposed MC-DS/CDMA system will be more serviceable in future wireless networks.
Lee, Kung-Tien y 李耿典. "Construction and performance analysis of new codes for optical CDMA networks with M-ary signaling". Thesis, 2001. http://ndltd.ncl.edu.tw/handle/67473600976189244194.
Texto completo國立中正大學
通訊工程研究所
89
In this thesis we investigate the construction of spreading code for optical CDMA systems. Because the characteristic of the electric and optical signal is different, e.g., the optical signal is positive and the electric signal may be positive or negative, the spreading code used in RF-CDMA systems is inappropriate to use in optical CDMA systems. The low noise property is an advantage in optical communications. Therefore, we don’t consider the effect of noise on the performance of our proposed systems. The main performance degradation is caused by the multiple access interference only. In this thesis we propose two new code constructions and analyze the performance for Direct Sequence (DS)-CDMA system and Fast Frequency Hopping (FFH) CDMA system respectively. Conventionally, the spreading codes for optical CDMA system encode one bit per symbol. However, both of our proposed new codes can encode k bits per symbol. Therefore, the transmission rate can be increased by k times with the new codes. Based on the performance analysis, we get the expected result that the BER of our proposed system is better than the conventional one.
Upadrashta, Raviteja. "Design and Development of a Passive Infra-Red-Based Sensor Platform for Outdoor Deployment". Thesis, 2017. http://etd.iisc.ac.in/handle/2005/3439.
Texto completoUpadrashta, Raviteja. "Design and Development of a Passive Infra-Red-Based Sensor Platform for Outdoor Deployment". Thesis, 2017. http://etd.iisc.ernet.in/2005/3439.
Texto completoVikas, G. "Power Optimal Network-On-Chip Interconnect Design". Thesis, 2010. https://etd.iisc.ac.in/handle/2005/1408.
Texto completoLibros sobre el tema "Code Construction Networks"
1968-, Zhang Qinqing, ed. Design and performance of 3G wireless networks and wireless LANs. New York: Springer Science+Business Media, 2006.
Buscar texto completoChuah, Mooi Choo y Qinqing Zhang. Design and Performance of 3G Wireless Networks and Wireless LANs. Springer, 2005.
Buscar texto completoHylander, Paul Donald. Design automation tools for pulse coded VLSI neural networks. 1994.
Buscar texto completoAmpadu, Paul y Qiaoyan Yu. Transient and Permanent Error Control for Networks-on-Chip. Springer, 2014.
Buscar texto completoAmpadu, Paul y Qiaoyan Yu. Transient and Permanent Error Control for Networks-On-Chip. Springer, 2011.
Buscar texto completoAmpadu, Paul y Qiaoyan Yu. Transient and Permanent Error Control for Networks-on-Chip. Springer, 2011.
Buscar texto completoWheeldon, Marianne. Debussy's Legacy and the Construction of Reputation. Oxford University Press, 2018. http://dx.doi.org/10.1093/acprof:oso/9780190631222.001.0001.
Texto completoHowe, Justine. Building the Webb Community. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780190258870.003.0002.
Texto completoMoore, Robbie. Hotel Modernity. Edinburgh University Press, 2021. http://dx.doi.org/10.3366/edinburgh/9781474456654.001.0001.
Texto completoTransient And Permanent Error Control For Networksonchip. Springer, 2011.
Buscar texto completoCapítulos de libros sobre el tema "Code Construction Networks"
Nirmaladevi, R. y K. Kishan Rao. "Optimal Codebook Construction Method Based on Zadoff-Chu Matrix for Code Division Multiple Access Systems". En Lecture Notes in Networks and Systems, 413–24. Singapore: Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-1976-3_50.
Texto completoLin, Shu, Jun Xu, Heng Tang y Yu Kou. "Geometric Constructions of Gallager Codes". En Communications, Information and Network Security, 147–62. Boston, MA: Springer US, 2003. http://dx.doi.org/10.1007/978-1-4757-3789-9_9.
Texto completoHorlemann-Trautmann, Anna-Lena y Joachim Rosenthal. "Constructions of Constant Dimension Codes". En Network Coding and Subspace Designs, 25–42. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-70293-3_2.
Texto completoDinneen, Michael J., Michael R. Fellows y Vance Faber. "Algebraic constructions of efficient broadcast networks". En Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 152–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/3-540-54522-0_104.
Texto completoOtal, Kamil y Ferruh Özbudak. "Constructions of Cyclic Subspace Codes and Maximum Rank Distance Codes". En Network Coding and Subspace Designs, 43–66. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-70293-3_3.
Texto completoFreij-Hollanti, Ragnar, Camilla Hollanti y Thomas Westerbäck. "Matroid Theory and Storage Codes: Bounds and Constructions". En Network Coding and Subspace Designs, 385–425. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-70293-3_15.
Texto completoShu, Zhong, Boer Deng, Luo Tian, Fen Duan, Xinyu Sun, Liangzhe Chen y Yue Luo. "Construction of SDN Network Management Model Based on Virtual Technology Application". En Proceeding of 2021 International Conference on Wireless Communications, Networking and Applications, 257–68. Singapore: Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-2456-9_28.
Texto completoRahimian, Farzad Pour, Jack Steven Goulding, Sepehr Abrishami, Saleh Seyedzadeh y Faris Elghaish. "Optical code division multiple access–based sensor network for monitoring construction sites affected by vibrations". En Industry 4.0 Solutions for Building Design and Construction, 357–80. London: Routledge, 2021. http://dx.doi.org/10.1201/9781003106944-16.
Texto completoYang, Pengfei, Renjue Li, Jianlin Li, Cheng-Chao Huang, Jingyi Wang, Jun Sun, Bai Xue y Lijun Zhang. "Improving Neural Network Verification through Spurious Region Guided Refinement". En Tools and Algorithms for the Construction and Analysis of Systems, 389–408. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72016-2_21.
Texto completoSotoudeh, Matthew y Aditya V. Thakur. "SyReNN: A Tool for Analyzing Deep Neural Networks". En Tools and Algorithms for the Construction and Analysis of Systems, 281–302. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72013-1_15.
Texto completoActas de conferencias sobre el tema "Code Construction Networks"
Mohammed, A., E. I. Babekir, N. Elfadel, N. M. Saad, M. S. Anuar, S. A. Aljunid y M. K. Abdullah. "OSCDMA Double Weight Code: A Simplified Formula Code Construction Technique". En 2007 IFIP International Conference on Wireless and Optical Communications Networks. IEEE, 2007. http://dx.doi.org/10.1109/wocn.2007.4284151.
Texto completoLi, Jianping, Man Hu y Zhiyuan Cheng. "Research on Polar Code Construction Algorithms Under Gaussian Channel". En 2018 Tenth International Conference on Ubiquitous and Future Networks (ICUFN). IEEE, 2018. http://dx.doi.org/10.1109/icufn.2018.8437011.
Texto completoBabekir, E. I., N. M. Saad, N. Elfadel, A. Mohammed, A. A. Aziz, M. S. Anuar, S. A. Aljunid y M. K. Abdullah. "Optical Spectrum CDMA: A New Code Construction with Zero Cross Correlation for Double Weight Code Family". En 2007 IFIP International Conference on Wireless and Optical Communications Networks. IEEE, 2007. http://dx.doi.org/10.1109/wocn.2007.4284152.
Texto completoWang, Fanggang. "Generalized diversity embedded block codes: code construction and PEP analysis in wireless cooperation networks". En 2008 Annual IEEE Student Paper Conference. IEEE, 2008. http://dx.doi.org/10.1109/aispc.2008.4460553.
Texto completoKumawat, Soma y Ravi Kumar Maddila. "Development of odd weight code construction for KS code with Ex-OR detection for SAC-OCDMA system". En 2019 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS). IEEE, 2019. http://dx.doi.org/10.1109/ants47819.2019.9117932.
Texto completoDuc Manh Nguyen y Sunghwan Kim. "Construction and complement circuit of a quantum stabilizer code with length 7". En 2016 Eighth International Conference on Ubiquitous and Future Networks (ICUFN). IEEE, 2016. http://dx.doi.org/10.1109/icufn.2016.7537043.
Texto completoSongsiri, Patoomsiri, Thimaporn Phetkaew, Ryutaro Ichise y Boonserm Kijsirikul. "Sub-classifier construction for error correcting output code using minimum weight perfect matching". En 2014 International Joint Conference on Neural Networks (IJCNN). IEEE, 2014. http://dx.doi.org/10.1109/ijcnn.2014.6889436.
Texto completoHe, Zhiyong, Sebastien Roy y Paul Fortier. "Powerful LDPC Codes for Broadband Wireless Networks: High-performance Code Construction and High-speed Encoder/Decoder Design". En 2007 International Symposium on Signals, Systems and Electronics. IEEE, 2007. http://dx.doi.org/10.1109/issse.2007.4294441.
Texto completoXiaobin Li. "Construction of optimal optical orthogonal signature patterns for high throughput optical code division multiple access image transmission". En IET International Conference on Wireless Mobile and Multimedia Networks Proceedings (ICWMMN 2006). IEE, 2006. http://dx.doi.org/10.1049/cp:20061258.
Texto completoMallawaarachchi, H., Y. G. Sandanayake, G. Karunasena y C. Liu. "Beyond the reuse: Potentials and barriers for exchanging treated wastewater among the industries in Sri Lanka". En 10th World Construction Symposium. Building Economics and Management Research Unit (BEMRU), University of Moratuwa, 2022. http://dx.doi.org/10.31705/wcs.2022.15.
Texto completoInformes sobre el tema "Code Construction Networks"
Abbo, Shahal, Hongbin Zhang, Clarice Coyne, Amir Sherman, Dan Shtienberg y George J. Vandemark. Winter chickpea; towards a new winter pulse for the semiarid Pacific Northwest and wider adaptation in the Mediterranean basin. United States Department of Agriculture, enero de 2011. http://dx.doi.org/10.32747/2011.7597909.bard.
Texto completo