Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

379 results for “T-code”
Set a search alert
Research ArticleOpen accessEvery word in the titleEfficient Detection Algorithm for a Multiple-Input and Multiple-Output Multiuser Multi-Carrier Code Division Multiple Access in Time-Varying ChannelsFares Sayadi, Mahamod Ismail, Norbahiah Misran et al.Problem statement: Maximum Likelihood (ML) decoding has been applied for the uplink of a Multi-Carrier Code Division Multiple Access (MC-CDMA) system based on Orthogonal Frequency Division Multiplexing (OFDM). Multiple-Input Multiple-Output (MIMO) channel from k users, which moves at vehicular speed, to the Base-Station (BS) is time-varying. For time-varying channels, Sphere Decoding (SD) was introduced to perform ML decoding. Whereas, computational … …American Journal of Engineering and Applied Sciences, Vol. 2, Issue 4 · 31 Dec 2009 · 7,576 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleProof-Carrying Code Based Tool for Secure Information Flow of Assembly ProgramsAbdulrahman Muthana, Abdul Azim Abd Ghani, Ramlan Mahmod, Hasan SelamatProblem statement: How a host (the code consumer) can determine with certainty that a downloaded program received from untrusted source (the code producer) will maintain the confidentiality of the data it manipulates and it is safe to install and execute. Approach: The approach adopted for verifying that a downloaded program will not leak confidential data to unauthorized parties was based … …Journal of Computer Science, Vol. 5, Issue 2 · 28 Feb 2009 · 7,354 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleReed-Muller Codec Simulation PerformanceO. O. Khalifa, A. H. Abdullah, N. Suriyana et al.The approach to error correction coding taken by modern digital communication systems started in the late 1940's with the ground breaking work of Shannon, Hamming and Golay. Reed-Muller (RM) codes were an important step beyond the Hamming and Golay codes because they allowed more flexibility in the size of the code word and the number of correctable errors per code … …Journal of Computer Science, Vol. 4, Issue 10 · 31 Oct 2008 · 7,284 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA Comparison Between the New and the Old Versions of Jordan Seismic CodeM.A. MusmarThe study comes as a vital step to shed120 light upon the purport of the recently published version of Jordan Seismic code (JSC), and how the drawbacks of the old version are surpassed. The new JSC code oversteps the old provisions, in that input parameters now have pronounced and significant physical meanings. The study concludes that the conversion from service … …American Journal of Applied Sciences, Vol. 4, Issue 4 · 30 Apr 2007 · 7,868 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleCluster Computing: A Mobile Code ApproachR. B. Patel, Manpreet SinghCluster computing harnesses the combined computing power of multiple processors in a parallel configuration. Cluster Computing environments built from commodity hardware have provided a cost-effective solution for many scientific and high-performance applications. In this paper we have presented design and implementation of a cluster based framework using mobile code. The cluster implementation involves the designing of a server named MCLUSTER … …Journal of Computer Science, Vol. 2, Issue 10 · 31 Oct 2006 · 6,714 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleDesign of Output Codes for Fast Covering Learning using Basic Decomposition TechniquesAruna Tiwari, Narendra S. ChaudhariWe propose the design of output codes for solving the classification problem in Fast Covering Learning Algorithm (FCLA). For a complex multi-class problem normally the classifiers are constructed by combining the outputs of several binary ones. In this paper, we use the basic methods of decomposition; one per class (OPC) and Error Correcting Output Code (ECOC) with FCLA, binary to … …Journal of Computer Science, Vol. 2, Issue 7 · 31 Jul 2006 · 6,302 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleApplication of T-Code, Turbo Codes and Pseudo-Random Sequence for SteganographyAnil Kumar, Navin RajpalIn this study, we propose new technique that will address the problem of robustness and data safety in steganography. The steganography consists of techniques to allow the communication between two persons, hiding not only the contents but also the very existence of the communication in the eyes of any observer. T-Codes used with Turbo Codes generates cryptic and error-coded data … …Journal of Computer Science, Vol. 2, Issue 2 · 28 Feb 2006 · 7,079 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleBayesian Regularization in a Neural Network Model to Estimate Lines of Code Using Function PointsK. K. Aggarwal, Yogesh Singh, Pravin Chandra, Manimala PuriIt is a well known fact that at the beginning of any project, the software industry needs to know, how much will it cost to develop and what would be the time required ? . This paper examines the potential of using a neural network model for estimating the lines of code, once the functional requirements are known. Using the … …Journal of Computer Science, Vol. 1, Issue 4 · 31 Dec 2005 · 30,191 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleEfficient Decoding Algorithm for Binary Quadratic Residue Codes Using Reduced Permutation SetsHamza Boualame, Mostafa Belkasmi, Idriss ChanaThe Quadratic Residue (QR) codes have a rich mathematic structure. Unfortunately, their Algebraic Decoding (AD) is not generalizable for all QR codes. In this study, an efficient hard decoding algorithm is proposed to generalize the decoding of the binary systematic Quadratic Residue (QR) codes. The proposed decoder corrects t erroneous bits or less, in the received word, based on a … …Journal of Computer Science, Vol. 19, Issue 4 · 3 Apr 2023 · 6,015 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleSimulated Annealing Decoder for Linear Block CodesLahcen Niharmine, Hicham Bouzkraoui, Ahmed Azouaoui, Youssef HadiIn this study, we introduce a novel soft decoder, the first of its kind, for linear block codes, based on Simulated Annealing algorithm (SA). The main enhancement in our contribution which let our decoder over performs with large gain (about 3 dB at 710-4) the classical SA approach, is to take the most reliable information set of the received codeword … …Journal of Computer Science, Vol. 14, Issue 8 · 4 Sep 2018 · 7,810 accessesView PDFCite