|
|
发表于 2025-12-2 18:15:48
|
显示全部楼层
成电刘姝副教授，12篇TIT，今年才拿到博导资格，这水平不吊锤这个来养老的？, e/ B% q: x( d/ v; z
Encoding and Decoding of Reed–Muller Codes With Quasi-Linear Complexity! D3 `* b" u; v4 |& b9 i4 p
Yi Kuang;/ ~9 v6 u, O: @. `' T
Songsong Li;
{7 X' g. c! H& X% uShu Liu;
+ e7 G/ M3 Y# @6 _; cLiming Ma;8 p7 B9 J: p$ C# }/ s) q3 V
Chaoping Xing0 r! X2 `- ]) q$ u4 T
IEEE Transactions on Information Theory
& R. {: `* t. S: o+ XYear: 2025 | Volume: 71, Issue: 12 | Journal Article | Publisher: IEEE2 C# b" W* g6 ?; b6 }
$ H; n# d$ _/ o5 X2 Y6 K3 D
Abstract6 _; T! F. P) j" Z* |
HTML
3 I* ^- E$ e( j3 k! A( c6 S% `( L1 l
Encoding of Algebraic Geometry Codes With Quasi-Linear Complexity O(NlogN)
# @* H1 l' ?; k9 pSongsong Li;
! ^5 X2 \$ N2 N+ A J- DShu Liu;
- W* i" T# v, \; S3 GLiming Ma;2 F! j9 g7 g& G% V: H5 ^6 y$ T4 `
Yunqi Wan;
3 _8 G. U6 Q, w5 x* VChaoping Xing. c) [; {5 r) g. f
IEEE Transactions on Information Theory" }/ k! K& j0 D; N- ?/ ]+ D2 @
Year: 2025 | Volume: 71, Issue: 7 | Journal Article | Publisher: IEEE1 I' e# O4 M, t5 q- X. u/ R
, `4 P' B' \$ G! E3 aAbstract( r) I1 m" K4 p$ C- }. D
HTML. R3 _3 D$ ]! d) J
9 @, `3 y3 \9 @# w( y1 Z# UExplicit Construction of q-Ary 2-Deletion Correcting Codes With Low Redundancy
/ H* U0 a* B q" pShu Liu;; L# D( ]6 L% a2 L$ r; P
Ivan Tjuawinata;
# d- u, t7 B! JChaoping Xing
4 `$ n8 \: G: y2 h& {IEEE Transactions on Information Theory
1 I4 q! P( g/ M+ @+ \7 qYear: 2024 | Volume: 70, Issue: 6 | Journal Article | Publisher: IEEE: N' F/ K. f3 M( a) Y" R
Cited by: Papers (4)
; ~ ^3 ~2 N) f* l* z$ h' I/ u: r7 x$ Q; G& F
Abstract
- V+ i% V9 V: KHTML* t! P( a$ K3 F' l
% z& L4 \7 X# i# B/ m w; [. ]A Lower Bound on the List-Decodability of Insdel Codes9 K& x6 o0 v& r, m
Shu Liu;6 G9 o- u+ @. h, N# F
Ivan Tjuawinata;# L: F [: \( f/ H+ B7 s, ]6 O
Chaoping Xing
, ~# S3 u- y' ? x. E+ FIEEE Transactions on Information Theory! n- `# O9 n0 m5 S5 R
Year: 2023 | Volume: 69, Issue: 11 | Journal Article | Publisher: IEEE' G2 H( [$ D: t H& B; n& g
% S% _* }( s/ d) w# S9 M# b
Abstract* Y5 \' u2 W+ N4 h8 b2 Q
HTML7 D2 A* \0 \- L, W
- N: \* P* w% \5 B" i
A New Construction of Nonlinear Codes via Algebraic Function Fields3 C3 t1 S. V" Q% E
Shu Liu;" z9 |$ u- g; q2 U9 K! @4 E# p
Liming Ma;. D9 l4 H6 ?8 g: M$ S3 }8 ~
Ting-Yi Wu;
( _! M& J2 u$ }Chaoping Xing" k9 W& u3 L _6 t$ ]; B* A
IEEE Transactions on Information Theory% a# h: p: T4 U4 E) j
Year: 2023 | Volume: 69, Issue: 9 | Journal Article | Publisher: IEEE
$ r' D; V" ^% X0 x0 FCited by: Papers (1), v7 I6 w$ k- M. b6 K
5 ?1 I, z) u- ^/ I \Abstract
& x! h x7 Z, ~% B8 W6 B$ e; ~" P0 AHTML' g: D3 e: G7 Y% s$ U( b" F' \8 g
4 W& E" ]3 N8 n6 |5 W2 o1 L, G. Q2 n
Maximally Recoverable Local Repairable Codes From Subspace Direct Sum Systems5 ]+ ?0 t5 S" W/ s1 `9 |
Shu Liu;) y U6 w0 D- R0 ~+ U: ~/ |
Chaoping Xing2 N" {8 O9 W- I1 @- b: P
IEEE Transactions on Information Theory3 a& N% z$ Y2 {6 U5 S1 o- i; ?+ E
Year: 2023 | Volume: 69, Issue: 4 | Journal Article | Publisher: IEEE
1 |2 V* o# T2 V# l6 a# D# YCited by: Papers (2)" O/ X; g2 T' R' a9 v
) C/ r+ `) t! WAbstract
! m3 I2 _3 T( z4 |HTML2 _3 m% M( M( B9 u2 r
. @, h3 F' O& {4 S. [, a0 B: {
Bounds and Constructions for Insertion and Deletion Codes
F; I; k6 |! p9 `1 k+ a+ U' I0 vShu Liu;
; i& V" i1 B7 J3 i. y# {4 @Chaoping Xing! c( A, S. L7 s1 _3 N
IEEE Transactions on Information Theory
1 v0 Z% A: N, o9 `0 ~$ |9 zYear: 2023 | Volume: 69, Issue: 2 | Journal Article | Publisher: IEEE
3 p$ g$ E9 x& ^3 l# ^Cited by: Papers (14)
( T0 C# \/ P) h8 ?8 s* G0 n) B3 o1 D
Abstract
: g" B9 h( W! \HTML
) |. a7 o# ^# [ {) I$ @2 y% g( C$ W* R
Efficiently List-Decodable Insertion and Deletion Codes via Concatenation
4 ?5 E; x) b3 k; s1 w) TShu Liu;6 g5 r J) S3 Z7 W8 r) C" W4 p
Ivan Tjuawinata;
. R7 _( {% A/ l* a9 g% b/ }Chaoping Xing2 Q C$ G0 F4 A! x! Z
IEEE Transactions on Information Theory$ g: _: ~# k! c) C
Year: 2021 | Volume: 67, Issue: 9 | Journal Article | Publisher: IEEE5 o: A1 M7 Q! i4 X3 O1 m3 }
Cited by: Papers (6)
! J4 R% h5 H# o( R( K6 a4 q' @ w6 @, L) p7 K
Abstract
( G1 c" j/ I4 b( u$ s! zHTML
* ]0 d2 e/ \! w2 t9 Y. W7 ? Z* P1 }# S9 s
Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime
0 [& d+ X3 ~/ |7 c( P8 w3 STai Do Duc;
8 ]6 h: [; L% c9 ^; j4 sShu Liu;- P- r1 r5 R& J8 |3 U
Ivan Tjuawinata;8 v! n: @- j2 Y) ]+ ?9 R& i
Chaoping Xing/ G: B. z% H+ M e
IEEE Transactions on Information Theory
, K, b5 R: h8 \5 GYear: 2021 | Volume: 67, Issue: 5 | Journal Article | Publisher: IEEE
9 ?4 M! F7 G E* ]* p/ lCited by: Papers (17)
5 z0 O9 t* |; z* P; m9 a5 S1 ]3 e, \3 Q% o0 C
Abstract
M J5 w5 |* Z0 f4 FHTML! |6 B* \' ` X$ l+ H
6 j! G) _& A! F. ~
List Decodability of Symbol-Pair Codes ~, ~2 }) t& f9 I, I
Shu Liu;3 q w$ F+ c6 K: W, c7 v" @1 V
Chaoping Xing;
; ]7 I' ?, H+ n/ Y1 J, b1 DChen Yuan
" p( s3 v/ i0 V+ d4 `# LIEEE Transactions on Information Theory+ ~/ r2 ~7 Z" O% L) U; `7 t
Year: 2019 | Volume: 65, Issue: 8 | Journal Article | Publisher: IEEE. V5 h; R' w4 }& \ s
Cited by: Papers (15)
9 U/ p: q1 m: m( M
3 E# Q7 A! B' z& mAbstract* l/ e: z, [& C- p/ y$ g* n1 i
HTML
( z- `+ S, `3 S/ z; B! T9 Y0 f2 n# _6 O0 g
List Decoding of Cover Metric Codes Up to the Singleton Bound
4 {9 ]# d, ^2 \' y4 h+ hShu Liu;2 b; j* }+ G- Q! u
Chaoping Xing;
4 S: ?1 p4 c1 K9 lChen Yuan6 U4 o- `. T5 p7 C. P
IEEE Transactions on Information Theory" \3 O; g* \! w7 o' h. U
Year: 2018 | Volume: 64, Issue: 4 | Journal Article | Publisher: IEEE
+ _( p2 M9 Y+ \0 Y+ f4 S0 DCited by: Papers (7)
2 ~# {% G4 b. m( d. |6 ?8 N/ x$ C' G2 j/ C; a7 ^/ [; N
Abstract
/ e$ D0 K/ R& h2 k5 i% n5 |HTML3 K2 |0 Y+ P7 c; M
% W4 Z: U- X: G; y3 n+ @List Decodability of Random Subcodes of Gabidulin Codes
9 I6 _ c H% K# A. K' k: H& f. t2 sShu Liu;/ v' {9 u$ k1 _# \4 _
Chaoping Xing;' K5 C4 v- s( s" g# W+ {# m$ Y
Chen Yuan, b0 C1 j! K3 x# j' l/ {% L
IEEE Transactions on Information Theory$ M& F% O! \0 V1 n- U4 o
Year: 2017 | Volume: 63, Issue: 1 | Journal Article | Publisher: IEEE
5 h# N! X! h( X& @+ X0 O" t! f+ eCited by: Papers (5)
+ Y9 N. N* a" H- ^% @( n |
|
[复制链接]
发表于 2025-12-2 11:45:36
楼主
