3,509 resources related to Binary codes
- Topics related to Binary codes
- IEEE Organizations related to Binary codes
- Conferences related to Binary codes
- Periodicals related to Binary codes
- Most published Xplore authors for Binary codes
ICC 2021 - IEEE International Conference on Communications
IEEE ICC is one of the two flagship IEEE conferences in the field of communications; Montreal is to host this conference in 2021. Each annual IEEE ICC conference typically attracts approximately 1,500-2,000 attendees, and will present over 1,000 research works over its duration. As well as being an opportunity to share pioneering research ideas and developments, the conference is also an excellent networking and publicity event, giving the opportunity for businesses and clients to link together, and presenting the scope for companies to publicize themselves and their products among the leaders of communications industries from all over the world.
2020 IEEE International Symposium on Information Theory (ISIT)
Information theory, coding theory, communication theory, signal processing, and foundations of machine learning
2020 IEEE International Symposium on Antennas and Propagation and North American Radio Science Meeting
The joint meeting is intended to provide an international forum for the exchange of information on state of the art research in the area of antennas and propagation, electromagnetic engineering and radio science
IEEE Global Communications Conference (GLOBECOM) is one of the IEEE Communications Society’s two flagship conferences dedicated to driving innovation in nearly every aspect of communications. Each year, more than 2,900 scientific researchers and their management submit proposals for program sessions to be held at the annual conference. After extensive peer review, the best of the proposals are selected for the conference program, which includes technical papers, tutorials, workshops and industry sessions designed specifically to advance technologies, systems and infrastructure that are continuing to reshape the world and provide all users with access to an unprecedented spectrum of high-speed, seamless and cost-effective global telecommunications services.
The International Conference on Image Processing (ICIP), sponsored by the IEEE SignalProcessing Society, is the premier forum for the presentation of technological advances andresearch results in the fields of theoretical, experimental, and applied image and videoprocessing. ICIP 2020, the 27th in the series that has been held annually since 1994, bringstogether leading engineers and scientists in image and video processing from around the world.
Broadcast technology, including devices, equipment, techniques, and systems related to broadcast technology, including the production, distribution, transmission, and propagation aspects.
Video A/D and D/A, display technology, image analysis and processing, video signal characterization and representation, video compression techniques and signal processing, multidimensional filters and transforms, analog video signal processing, neural networks for video applications, nonlinear video signal processing, video storage and retrieval, computer vision, packet video, high-speed real-time circuits, VLSI architecture and implementation for video technology, multiprocessor systems--hardware and software-- ...
Part I will now contain regular papers focusing on all matters related to fundamental theory, applications, analog and digital signal processing. Part II will report on the latest significant results across all of these topic areas.
Covers topics in the scope of IEEE Transactions on Communications but in the form of very brief publication (maximum of 6column lengths, including all diagrams and tables.)
Telephone, telegraphy, facsimile, and point-to-point television, by electromagnetic propagation, including radio; wire; aerial, underground, coaxial, and submarine cables; waveguides, communication satellites, and lasers; in marine, aeronautical, space and fixed station services; repeaters, radio relaying, signal storage, and regeneration; telecommunication error detection and correction; multiplexing and carrier techniques; communication switching systems; data communications; and communication theory. In addition to the above, ...
1965 IEEE International Solid-State Circuits Conference. Digest of Technical Papers, 1965
Proceedings of 1995 IEEE International Symposium on Information Theory, 1995
Two major issues in noisy channel vector quantization are complexity and sensitivity to channel errors. Structured vector quantizers and index assignments provide a low complexity solution for enhancing channel robustness. A general formula is given for the MSE performance of affine index assignments for a binary symmetric channel with an arbitrary source and a binary lattice quantizer. The result is ...
IEEE Transactions on Information Theory, 2003
The minimum number of codewords in a binary code with length n and covering radius R is denoted by K(n,R), and corresponding codes are called optimal. A code with M words is said to be balanced in a given coordinate if the number of 0's and 1's in this coordinate are at least /spl lfloor/M/2/spl rfloor/. A code is balanced ...
IEEE Transactions on Information Theory, 2011
Let_m_and_k_be positive integers with_m_/gcd(_m_,_k_) being odd, for_a_∈ R and_b_∈ L, the exponential sum Σ_x_∈L_iTr_(_ax_+2_bx_2_k_+1) is studied systematically in this paper, where_i_=√(-1), R = GR (4,_m_) is a Galois ring, L is the Teichmüller set of R and_Tr_(·) is the trace function from the Galois ring R to Z4. Through the discussions on the solutions of certain equations and the newly ...
2005 11th International Scientific and Practical Conference of Students, Post-graduates and Young Scientists - Modern Technique and Technologies, 2005
Development of highly effective quick-acting multiple inputs of machine arithmetic digital electric drives is one of topical problems. A great amount of works in this field (Rabiner L., Gold B., Sholomov L.A.) confirm constant interest to the problem. Adder- subtractors used in digital devices determine the rate of fulfilling mathematical operations. Binary system of notations used in well known devices ...
Computing Based on Material Training: Application to Binary Classification Problems - IEEE Rebooting Computing 2017
Modulaciones Digitales Avanzadas - Parte 1
"IEEE's Role in Developing the National Electrical Code" - IEEE Hampton Roads Section Presentation
IEEE Hampton Roads Presentation "IEEE's Role in Developing the National Electrical Code"
Modulaciones Digitales Avanzadas - Parte 2
Noise-Shaped Active SAR Analog-to-Digital Converter - IEEE Circuits and Systems Society (CAS) Distinguished Lecture
Energy Efficiency of MRR-based BDD Circuits - Ozan Yakar - ICRC San Mateo, 2019
Probing the Universe with Gravitational Waves - Applied Superconductivity Conference 2018
An Integrated Optical Parallel Multiplier Exploiting Approximate Binary Logarithms - Jun Shiomi - ICRC 2018
David Forney - IEEE Medal of Honor 2016
Ulf Lindqvist presents the IEEE Cybersecurity Initiative (CybSI): 2016 End to End Trust and Security Workshop for the Internet of Things
Designing Reconfigurable Large-Scale Deep Learning Systems Using Stochastic Computing - Ao Ren: 2016 International Conference on Rebooting Computing
Quantum Computation - ASC-2014 Plenary series - 4 of 13 - Tuesday 2014/8/12
A 12-b, 1-GS/s 6.1mW Current-Steering DAC in 14nm FinFET with 80dB SFDR for 2G/3G/4G Cellular Application: RFIC Industry Showcase 2017
Molecular Cellular Networks: A Non von Neumann Architecture for Molecular Electronics - Craig Lent: 2016 International Conference on Rebooting Computing
Kees Immink, 2017 IEEE Medal of Honor
IEEE Richard W. Hamming Medal - Erdal Arikan - 2018 IEEE Honors Ceremony
The Prospects for Scalable Quantum Computing with Superconducting Circuits - Applied Superconductivity Conference 2018
Larson Collection interview with John V. Atanasoff
Two major issues in noisy channel vector quantization are complexity and sensitivity to channel errors. Structured vector quantizers and index assignments provide a low complexity solution for enhancing channel robustness. A general formula is given for the MSE performance of affine index assignments for a binary symmetric channel with an arbitrary source and a binary lattice quantizer. The result is then used to compare some well-known redundancy free codes. The binary asymmetric channel is considered for a uniform input distribution and a class of affine codes.
The minimum number of codewords in a binary code with length n and covering radius R is denoted by K(n,R), and corresponding codes are called optimal. A code with M words is said to be balanced in a given coordinate if the number of 0's and 1's in this coordinate are at least /spl lfloor/M/2/spl rfloor/. A code is balanced if it is balanced in all coordinates. It has been conjectured that among optimal covering codes with given parameters there is at least one balanced code. By using a computational method for classifying covering codes, it is shown that there is no balanced code attaining K(9,1)=62.
Let_m_and_k_be positive integers with_m_/gcd(_m_,_k_) being odd, for_a_∈ R and_b_∈ L, the exponential sum Σ_x_∈L_iTr_(_ax_+2_bx_2_k_+1) is studied systematically in this paper, where_i_=√(-1), R = GR (4,_m_) is a Galois ring, L is the Teichmüller set of R and_Tr_(·) is the trace function from the Galois ring R to Z4. Through the discussions on the solutions of certain equations and the newly developed theory of Z4-valued quadratic forms, the distribution of the exponential sum is completely determined. As its applications, we can determine the Lee weight and Hamming weight distributions of a class of codes_Ck_over Z4and the correlation distribution of a quaternary sequence family_Uk_, respectively. Furthermore, the Hamming weight distributions of the binary codes obtained from_Ck_under the most significant bit (MSB) and Gray maps are also determined. For the MSB map sequences of_Uk_, the nontrivial maximal correlation value is given and the correlation distribution is determined for the Gray map sequences of_Uk_. It should be noted that the distribution of the exponential sum for the case gcd(_m_,_k_) ≠ 1 is obtained for the first time, and then the corresponding codes and sequences are novel.
Development of highly effective quick-acting multiple inputs of machine arithmetic digital electric drives is one of topical problems. A great amount of works in this field (Rabiner L., Gold B., Sholomov L.A.) confirm constant interest to the problem. Adder- subtractors used in digital devices determine the rate of fulfilling mathematical operations. Binary system of notations used in well known devices in so doing.
Summary form only given. Many popular redundancy free codes are linear or affine, including the natural binary code (NBC), the folded binary code (FBC), the Gray code (GC), and the two's complement code (TCC). A theorem which considers the channel distortion of a uniform 2/sup n/ level scalar quantizer with stepsize /spl Delta/, which uses an affine index assignment with generator matrix G to transmit across a binary symmetric channel with crossover probability q, is given. Using this theorem we compare the NBC and the FBC for any source distribution.
The relation of logical functions is analyzed. The fundamental function which includes independent function is introduced and generic expression of logical function which is similar to Walsh function is given. The analysis and results are based on linear space theory.<<ETX>>
Proposing a new algorithm which is simple but effective. Using characteristic of biological evolution and common sense to design the selection operator, improve the variation method of the crossover probability and the mutation probability. Numerical experiments show that the new algorithm is more effective than the comparative algorithm in realizing the high convergence speed, convergence precision, reducing the convergence generation and good at keeping the stability of the adaptive genetic algorithm.
How to avoid premature convergence and maintain diversity of Pareto-optimal solutions for multi-objective optimization problems is addressed. An improved non-dominated sorting genetic algorithm is put forward, in which Gray and real codes are used for crossover and mutation operations, respectively, and chaotic variables are applied to produce initial population and control the crossover/mutation operations. The Gray-code based crossover operator has greater search ability and can produce more new individuals which preserve the best genes. The mutation operator with real-code mechanism has larger search range and higher precision, which can enlarge the diversity of population. The proposed method is demonstrated using three classical test functions.
No standards are currently tagged "Binary codes"