The Experts below are selected from a list of 34131 Experts worldwide ranked by ideXlab platform
Vincent Michel - One of the best experts on this subject based on the ideXlab platform.
-
inverse conductivity problem on riemann surfaces
Journal of Geometric Analysis, 2008Co-Authors: Gennadi Henkin, Vincent MichelAbstract:An electrical potential U on a bordered Riemann surface X with conductivity function σ>0 Satisfies Equation d(σdcU)=0. The problem of effective reconstruction of σ from electrical currents measurements (Dirichlet-to-Neumann mapping) on the boundary: U|bX↦σdcU|bX is studied. We extend to the case of Riemann surfaces the reconstruction scheme given, firstly, by R. Novikov (Funkc. Anal. Ego Priloz. 22:11–22, 2008) for simply connected X. We apply for this new kernels for \(\bar{ \partial }\) on the affine algebraic Riemann surfaces constructed in Henkin (arXiv:0804.3761, 2008).
-
inverse conductivity problem on riemann surfaces
arXiv: Analysis of PDEs, 2008Co-Authors: Gennadi Henkin, Vincent MichelAbstract:An electrical potential U on a bordered Riemann surface X with conductivity function sigma>0 Satisfies Equation d(sigma d^cU)=0. The problem of effective reconstruction of sigma is studied. We extend to the case of Riemann surfaces the reconstruction scheme given, firstly, by R.Novikov (1988) for simply connected X. We apply for this new kernels for dbar on affine algebraic Riemann surfaces constructed in Henkin, arXiv:0804.3761
Gennadi Henkin - One of the best experts on this subject based on the ideXlab platform.
-
inverse conductivity problem on riemann surfaces
Journal of Geometric Analysis, 2008Co-Authors: Gennadi Henkin, Vincent MichelAbstract:An electrical potential U on a bordered Riemann surface X with conductivity function σ>0 Satisfies Equation d(σdcU)=0. The problem of effective reconstruction of σ from electrical currents measurements (Dirichlet-to-Neumann mapping) on the boundary: U|bX↦σdcU|bX is studied. We extend to the case of Riemann surfaces the reconstruction scheme given, firstly, by R. Novikov (Funkc. Anal. Ego Priloz. 22:11–22, 2008) for simply connected X. We apply for this new kernels for \(\bar{ \partial }\) on the affine algebraic Riemann surfaces constructed in Henkin (arXiv:0804.3761, 2008).
-
inverse conductivity problem on riemann surfaces
arXiv: Analysis of PDEs, 2008Co-Authors: Gennadi Henkin, Vincent MichelAbstract:An electrical potential U on a bordered Riemann surface X with conductivity function sigma>0 Satisfies Equation d(sigma d^cU)=0. The problem of effective reconstruction of sigma is studied. We extend to the case of Riemann surfaces the reconstruction scheme given, firstly, by R.Novikov (1988) for simply connected X. We apply for this new kernels for dbar on affine algebraic Riemann surfaces constructed in Henkin, arXiv:0804.3761
Jesper Nederlof - One of the best experts on this subject based on the ideXlab platform.
-
sharper upper bounds for unbalanced uniquely decodable code pairs
International Symposium on Information Theory, 2016Co-Authors: Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper NederlofAbstract:Two sets A, B ⊆ {0, 1}n form a Uniquely Decodable Code Pair (UDCP) if every pair a ∈ A, b ∈ B yields a distinct sum a+b, where the addition is over ℤn. We show that every UDCP A, B, with |A| = 2(1−e)n and |B| = 2βn, Satisfies Equation. For sufficiently small e, this bound significantly improves previous bounds by Urbanke and Li [Information Theory Workshop ′98] and Ordentlich and Shayevitz [2014, arXiv:1412.8415], which upper bound β by 0.4921 and 0.4798, respectively, as e approaches 0.
Per Austrin - One of the best experts on this subject based on the ideXlab platform.
-
sharper upper bounds for unbalanced uniquely decodable code pairs
International Symposium on Information Theory, 2016Co-Authors: Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper NederlofAbstract:Two sets A, B ⊆ {0, 1}n form a Uniquely Decodable Code Pair (UDCP) if every pair a ∈ A, b ∈ B yields a distinct sum a+b, where the addition is over ℤn. We show that every UDCP A, B, with |A| = 2(1−e)n and |B| = 2βn, Satisfies Equation. For sufficiently small e, this bound significantly improves previous bounds by Urbanke and Li [Information Theory Workshop ′98] and Ordentlich and Shayevitz [2014, arXiv:1412.8415], which upper bound β by 0.4921 and 0.4798, respectively, as e approaches 0.
Petteri Kaski - One of the best experts on this subject based on the ideXlab platform.
-
sharper upper bounds for unbalanced uniquely decodable code pairs
International Symposium on Information Theory, 2016Co-Authors: Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper NederlofAbstract:Two sets A, B ⊆ {0, 1}n form a Uniquely Decodable Code Pair (UDCP) if every pair a ∈ A, b ∈ B yields a distinct sum a+b, where the addition is over ℤn. We show that every UDCP A, B, with |A| = 2(1−e)n and |B| = 2βn, Satisfies Equation. For sufficiently small e, this bound significantly improves previous bounds by Urbanke and Li [Information Theory Workshop ′98] and Ordentlich and Shayevitz [2014, arXiv:1412.8415], which upper bound β by 0.4921 and 0.4798, respectively, as e approaches 0.
