نتایج جستجو برای: hadamard

تعداد نتایج: 6667  

Journal: :J. Comb. Theory, Ser. A 1992
Robert Craigen Jennifer Seberry Xian-Mo Zhang

We prove that if there exist Hadamard matrices of order 4m, 4n, 4p, and 4q then there exists an Hadamard matrix of order 16mnpq. This improves and extends the known result of Agayan that there exists a Hadamard matrix of order 8mn if there exist Hadamard matrices of order 4m and 4n. Disciplines Physical Sciences and Mathematics Publication Details R. Craigen, Jennifer Seberry and Xian-Mo Zhang,...

Journal: :Australasian J. Combinatorics 1995
A. Baliga Kathy J. Horadam

A natural starting point in a systematic search for co cyclic Hadamard matrices is the study of the case of co cycles over the groups Zt x Z~, for t odd. The solution set includes all Williamson Hadamard matrices, so this set of groups is potentially a uniform source for generation of Hadamard matrices. We present our analytical and computational results.

2014
A. G. GHAZANFARI A. GHAZANFARI A. BARANI

In this paper we introduce operator preinvex functions and establish a Hermite–Hadamard type inequality for such functions. We give an estimate of the right hand side of a Hermite–Hadamard type inequality in which some operator preinvex functions of selfadjoint operators in Hilbert spaces are involved. Also some Hermite–Hadamard type inequalities for the product of two operator preinvex functio...

Journal: :Australasian J. Combinatorics 2013
Máté Matolcsi Imre Z. Ruzsa Mihály Weiner

We use combinatorial and Fourier analytic arguments to prove various non-existence results on systems of real and complex unbiased Hadamard matrices. In particular, we prove that a complete system of complex mutually unbiased Hadamard matrices (MUHs) in any dimension cannot contain more than one real Hadamard matrix. We also give new proofs of several known structural results in low dimensions.

Journal: :Des. Codes Cryptography 2007
Ji-Woong Jang Jong-Seon No Habong Chung

In this paper, we introduce a class of generalized Hadamard matrices, called a Butson Hadamard matrix with partially cyclic core. Then a new construction method for Butson Hadamard matrices with partially cyclic core is proposed. The proposed matrices are constructed from the optimal balanced low-correlation zone(LCZ) sequence set which has correlation value −1 within LCZ.

2017
JAKOB WASSERMANN ANDRZEJ DZIECH

Watermarking technology.play a central role in the digital right management for multimedia data. Especially a video watermarking is a real challenge, because of very high compression ratio (about 1:200). Normally the watermarks can barely survive such massive attacks, despite very sophisticated embedding strategies. It can only work with a sufficient error correcting code method. In this paper,...

In this paper we establish several polynomials similar to Bernstein's polynomials and several refinements of  Hermite-Hadamard inequality for convex functions.

2007
Shalom Eliahou

For every n divisible by 4, we construct a square matrix H of size n, with coeecients 1, such that H H t nI mod 32. This solves the 32-modular version of the classical Hadamard conjecture. We also determine the set of lengths of 16-modular Golay sequences. 0. Introduction Hadamard matrices can be constructed from various binary sequences, either from Golay complementary sequences, or Williamson...

Journal: :Australasian J. Combinatorics 1994
Hiroshi Kimura

In [2] Bussemaker and Tonchev constructed six doubly even (56,28, 12) codes from two Hadamard matrices of order 28. But two of them were not distinguished. In [11] and [12] we characterized Hadamard matrices of order 28 and there are exactly 487 Hadamard matrices, up to equivalence. In this paper we show that only two of the above 487 matrices produce six doubly even (56,28,12) codes and that t...

2008
N. Pinnawala A. Rao

Over the past couple of years trace maps over Galois fields and Galois rings have been used very successfully to construct cocyclic Hadamard, complex Hadamard and Butson Hadamard matrices and subsequently to generate simplex codes over Z4,Z2s and Zp and new linear codes over Zps . Here we define a new map, the trace-like map and more generally the weighted-trace map and extend these techniques ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید

function paginate(evt) { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term pg=parseInt(evt.target.text) var data={ "year":filter_year, "term":term, "pgn":pg } filtered_res=post_and_fetch(data,url) window.scrollTo(0,0); } function update_search_meta(search_meta) { meta_place=document.getElementById("search_meta_data") term=search_meta.term active_pgn=search_meta.pgn num_res=search_meta.num_res num_pages=search_meta.num_pages year=search_meta.year meta_place.dataset.term=term meta_place.dataset.page=active_pgn meta_place.dataset.num_res=num_res meta_place.dataset.num_pages=num_pages meta_place.dataset.year=year document.getElementById("num_result_place").innerHTML=num_res if (year !== "unfilter"){ document.getElementById("year_filter_label").style="display:inline;" document.getElementById("year_filter_place").innerHTML=year }else { document.getElementById("year_filter_label").style="display:none;" document.getElementById("year_filter_place").innerHTML="" } } function update_pagination() { search_meta_place=document.getElementById('search_meta_data') num_pages=search_meta_place.dataset.num_pages; active_pgn=parseInt(search_meta_place.dataset.page); document.getElementById("pgn-ul").innerHTML=""; pgn_html=""; for (i = 1; i <= num_pages; i++){ if (i===active_pgn){ actv="active" }else {actv=""} pgn_li="
  • " +i+ "
  • "; pgn_html+=pgn_li; } document.getElementById("pgn-ul").innerHTML=pgn_html var pgn_links = document.querySelectorAll('.mypgn'); pgn_links.forEach(function(pgn_link) { pgn_link.addEventListener('click', paginate) }) } function post_and_fetch(data,url) { showLoading() xhr = new XMLHttpRequest(); xhr.open('POST', url, true); xhr.setRequestHeader('Content-Type', 'application/json; charset=UTF-8'); xhr.onreadystatechange = function() { if (xhr.readyState === 4 && xhr.status === 200) { var resp = xhr.responseText; resp_json=JSON.parse(resp) resp_place = document.getElementById("search_result_div") resp_place.innerHTML = resp_json['results'] search_meta = resp_json['meta'] update_search_meta(search_meta) update_pagination() hideLoading() } }; xhr.send(JSON.stringify(data)); } function unfilter() { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":"unfilter", "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } function deactivate_all_bars(){ var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(bar) { bar.dataset.active = false bar.style = "stroke:#71a3c5;" }) } year_chart.on("created", function() { var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(check) { check.addEventListener('click', checkIndex); }) }); function checkIndex(event) { var yrchart = document.querySelectorAll('.ct-bar'); var year_bar = event.target if (year_bar.dataset.active == "true") { unfilter_res = unfilter() year_bar.dataset.active = false year_bar.style = "stroke:#1d2b3699;" } else { deactivate_all_bars() year_bar.dataset.active = true year_bar.style = "stroke:#e56f6f;" filter_year = chart_data['labels'][Array.from(yrchart).indexOf(year_bar)] url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":filter_year, "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } } function showLoading() { document.getElementById("loading").style.display = "block"; setTimeout(hideLoading, 10000); // 10 seconds } function hideLoading() { document.getElementById("loading").style.display = "none"; } -->